34 search results - page 7 / 7 » Approximation Algorithms to Minimum Vertex Cover Problems on... |
JDA
2007
13 years 5 months ago
2007
Given an undirected graph G = (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starti...
HEURISTICS
2006
13 years 5 months ago
2006
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
STOC
2009
ACM
14 years 5 months 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...