500 search results - page 45 / 100 » Approximation algorithms for maximum independent set of pseu... |
105
click to vote
COCOA
2008
Springer
15 years 3 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
141
click to vote
EPS
1998
Springer
15 years 6 months ago
1998
Springer
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel ...
126
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
118
click to vote
SMI
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract In this paper, we study the problem of approximate topological matching for quadrilateral meshes, that is, the problem of finding as large a set as possible of matching p...
114
Voted
COMPGEOM
2006
ACM
15 years 7 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...