9572 search results - page 35 / 1915 » Cover Algorithms and Their Combination |
143
click to vote
ESA
2010
Springer
15 years 26 days 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...
105
click to vote
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
ICDAR
2003
IEEE
15 years 5 months ago
2003
IEEE
In the frame of a Unified Messaging System, a crucial task of the system is to provide the user with key information on every message received, like keywords reflecting the object...
ISAAC
2004
Springer
15 years 5 months ago
2004
Springer
STOC
2010
ACM
15 years 9 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...