3875 search results - page 51 / 775 » Approximation algorithms for the 0-extension problem |
TALG
2010
15 years 10 days ago
2010
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
STOC
2002
ACM
16 years 2 months ago
2002
ACM
143
click to vote
IPL
2000
15 years 1 months ago
2000
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...
134
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...