52 search results - page 4 / 11 » An Improved Approximation Algorithm for Vertex Cover with Ha... |
142
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
151
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
119
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...
138
click to vote
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
151
click to vote
WAOA
2005
Springer
15 years 9 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...