A packing problem with applications to lettering of maps
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
The problem of compatible representatives
SIAM Journal on Discrete Mathematics
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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 |
Map labeling is a classical key problem. The interest in this problem has grown over the last years, because of the need to churn out different types of maps from a growing and altering set of data. We will show that the problem of placing street names without conflicts in a rectangular grid of streets is NP-complete and APX-hard. This is the first result of this type in this area. Further importance of this result arises from the fact that the considered problem is a simple one. Each row and column of the rectangular grid of streets contains just one street and the corresponding name may be placed anywhere in that line.