105 search results - page 6 / 21 » Improved approximation algorithms for minimum-weight vertex ... |
132
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
107
click to vote
ICMCS
2005
IEEE
15 years 9 months ago
2005
IEEE
A new, area-based mesh simplification algorithm is described. The proposed algorithm removes the center vertex of a polygon which consists of n ≥ 3 faces and represents that po...
101
Voted
CPE
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. Approximate Mean Value Analysis (MVA) is a popular technique for analyzing queueing networks because of the efficiency and accuracy that it affords. In this paper, we pre...
142
Voted
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
128
Voted
COCO
2009
Springer
15 years 10 months ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...