Name
Title | ||
|---|---|---|
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares |
Abstract | ||
|---|---|---|
We give a polynomial-time approximation scheme for the unique unit-square coverage problem: given a set of points and a set of axis-parallel unit squares, both in the plane, we wish to find a subset of squares that maximizes the number of points contained in exactly one square in the subset. Erlebach and van Leeuwen (2008) introduced this problem as the geometric version of the unique coverage problem, and the best approximation ratio by van Leeuwen (2009) before our work was 2. Our scheme can be generalized to the budgeted unique unit-square coverage problem, in which each point has a profit, each square has a cost, and we wish to maximize the total profit of the uniquely covered points under the condition that the total cost is at most a given bound. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.comgeo.2015.10.004 | Computational Geometry: Theory and Applications |
Keywords | Field | DocType |
Polynomial-time approximation scheme,Unique coverage problem,Dynamic programming,Shifting strategy | Discrete mathematics,Combinatorics,Total cost,Polynomial-time approximation scheme,Mathematics | Conference |
Volume | Issue | ISSN |
51 | C | 0925-7721 |
Citations | PageRank | References |
4 | 0.51 | 18 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Takehiro Ito | 1 | 260 | 40.71 |
| Shin-ichi Nakano | 2 | 246 | 24.40 |
| Yoshio Okamoto | 3 | 170 | 28.50 |
| Yota Otachi | 4 | 161 | 37.16 |
| Ryuhei Uehara | 5 | 528 | 75.38 |
| Takeaki Uno | 6 | 1319 | 107.99 |
| yushi uno | 7 | 222 | 28.80 |