1486 search results - page 30 / 298 » Algorithms for two-box covering |
WAOA
2005
Springer
14 years 1 months ago
2005
Springer
In the machine cover problem we are given m machines and n jobs to be assigned (scheduled) so that the smallest load of a machine is as large as possible. A semi-online algorithm i...
ESA
2010
Springer
13 years 9 months ago
2010
Springer
We consider the Minimum Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rect...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
ISAAC
2004
Springer
14 years 1 months ago
2004
Springer
STOC
2010
ACM
14 years 5 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...