Abstract
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.
Supported by DFG Project HR 14/5-1 “Zur Klassifizierung der Klasse praktisch lösbarer algorithmischer Aufgaben”
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Jon Christensen, Joe Marks, Stuart Shieber: Labeling Point Features on Maps and Diagrams, Harvard CS, 1992, TR-25-92.
Michael Formann, Frank Wagner: A Packing Problem with Applications to Lettering of Maps, Proc. 7th Annu. ACM Sympos. Comput. Geom., 1991, pp. 281–288.
J. Håstad: Some optimal inapproximability results, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997, pp. 1–10.
D. S. Hochbaum (Ed.): Approximation Algorithms for NP-hard Problems. PWS Publishing Company 1996.
Claudia Iturriaga, Anna Lubiw: NP-Hardness of Some Map Labeling Problems, University of Waterloo, Canada, 1997, CS-97-18.
T. Kato, H. Imai: The NP-Completeness of the Character Placement Problem of 2 or 3 degrees of freedom, Record of Joint Conference of Electrical and Electronic Engineers in Kyushu, 1988, pp. 1138.
Donald E. Knuth, Arvind Raghunathan: The Problem of Compatible Representatives, SIAM J. Discr. Math., 1992, Vol. 5, Nr. 3, pp. 422–427.
E. W. Mayr, H. J. Prömel, A. Steger (Eds.): Lectures on Proof Verification and Approximation Algorithms. LNCS 1967, Springer 1998.
Joe Marks, Stuart Shieber: The Computational Complexity of Cartographic Label Placement, Harvard CS, 1991, TR-05-91.
Gabriele Neyer, Frank Wagner: Labeling Downtown, Department of Computer Science, ETH Zurich, Switzerland, TR 324, May 1999
Tycho Strijk, Alexander Wolff: Labeling Points with Circles, Institut für Informatik, Freie Universität Berlin, 1999, B 99-08.
Tycho Strijk, Alexander Wolff: The Map Labeling Bibliography, http://www.inf.fu-berlin.de/map-labeling/bibliography.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Seibert, S., Unger, W. (2000). The Hardness of Placing Street Names in a Manhattan Type Map. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds) Algorithms and Complexity. CIAC 2000. Lecture Notes in Computer Science, vol 1767. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46521-9_9
Download citation
DOI: https://doi.org/10.1007/3-540-46521-9_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67159-6
Online ISBN: 978-3-540-46521-8
eBook Packages: Springer Book Archive