1814 search results - page 7 / 363 » Improved Results on Geometric Hitting Set Problems |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We provide an O(log log OPT)-approximation algorithm for the problem of guarding a simple polygon with guards on the perimeter. We first design a polynomial-time algorithm for bui...
IEEEPACT
2002
IEEE
14 years 19 days ago
2002
IEEE
Memory performance is increasingly determining microprocessor performance and technology trends are exacerbating this problem. Most architectures use set-associative caches with L...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
FOCS
1996
IEEE
13 years 12 months ago
1996
IEEE
A common subproblem of DNF approximate counting and derandomizing RL is the discrepancy problem for combinatorial rectangles. We explicitly construct a poly(n)-size sample space t...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...