455 search results - page 32 / 91 » Approximation Algorithms for Partial Covering Problems |
177
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
174
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
184
click to vote
ISAAC
2007
Springer
16 years 14 days 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...
148
click to vote
DAM
1999
15 years 6 months ago
1999
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
171
click to vote
COR
2007
15 years 6 months ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...