Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Hardness of Placing Street Names in a Manhattan Type Map
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Periodic multi-labeling of public transit lines
GIScience'10 Proceedings of the 6th international conference on Geographic information science
| Hi-index | 0.00 |
American cities, especially their central regions usually have a very regular street pattern:We are given a rectangular grid of streets, each street has to be labeled with a name running along its street, such that no two labels overlap. For this restricted but yet realistic case an efficient algorithmic solution for the generally hard labeling problem gets in reach. The main contribution of this paper is an algorithm that guarantees to solve every solvable instance. In our experiments the running time is polynomial without a single exception. On the other hand the problem was recently shown to be NP-hard. Finally, we present efficient algorithms for three special cases including the case of having no labels that are more than half the length of their street.