Weighted geometric set multi-cover via quasi-uniform sampling
<p>We give a randomized polynomial time algorithm with approximation ratio $O(\log \phi(n))$ for weighted set multi-cover instances with a shallow cell complexity of at most $f(z,k) =z\phi(z) k^{O(1)}$. Up to constant factors, this matches a recent result of Chan, Grant, Konemann and Sharpe fo...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Carleton University
2016-05-01
|
| Series: | Journal of Computational Geometry |
| Online Access: | http://jocg.org/index.php/jocg/article/view/126 |