3875 search results - page 117 / 775 » Approximation Algorithms for the Max-coloring Problem |
127
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
156
Voted
INFOCOM
2012
IEEE
13 years 5 months ago
2012
IEEE
—This paper addresses the joint selection and power assignment of a largest set of given links which can communicate successfully at the same time under the physical interference...
154
Voted
ACST
2006
15 years 4 months ago
2006
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
136
click to vote
ICML
1996
IEEE
15 years 6 months ago
1996
IEEE
This paper presents a direct reinforcement learning algorithm, called Finite-Element Reinforcement Learning, in the continuous case, i.e. continuous state-space and time. The eval...
139
click to vote
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...