1389 search results - page 22 / 278 » Improved Approximation Algorithms for Label Cover Problems |
114
Voted
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
118
click to vote
SODA
1992
ACM
15 years 21 days ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
102
click to vote
ADHOCNOW
2008
Springer
15 years 5 months ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
107
click to vote
WG
2007
Springer
15 years 5 months ago
2007
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 ...