1389 search results - page 8 / 278 » Improved Approximation Algorithms for Label Cover Problems |
MFCS
2009
Springer
13 years 12 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
ANTSW
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
SPAA
2010
ACM
14 years 5 days ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
ADHOCNOW
2004
Springer
14 years 23 days ago
2004
Springer
ICALP
2003
Springer
14 years 17 days ago
2003
Springer