1389 search results - page 48 / 278 » Improved Approximation Algorithms for Label Cover Problems |
131
Voted
IPL
1998
15 years 2 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
132
Voted
CCE
2004
15 years 2 months ago
2004
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
143
Voted
JCSS
2002
15 years 2 months ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
126
Voted
SIAMCOMP
2008
15 years 2 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
137
Voted
ISAAC
2007
Springer
15 years 8 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...