151 search results - page 19 / 31 » The Minimum Generalized Vertex Cover Problem |
102
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
119
click to vote
SODA
1992
ACM
15 years 25 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...
113
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
STOC
2009
ACM
16 years 9 days ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
129
click to vote
SWAT
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...