{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:59Z","timestamp":1725664259403},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540603139"},{"type":"electronic","value":"9783540449133"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60313-1_160","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:16:55Z","timestamp":1330280215000},"page":"420-433","source":"Crossref","is-referenced-by-count":3,"title":["An efficient and effective approximation algorithm for the Map Labeling Problem"],"prefix":"10.1007","author":[{"given":"Frank","family":"Wagner","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"31_CR1","unstructured":"H. Aonuma, H. Imai, Y. Kambayashi, A visual system of placing characters appropriatly in multimedia map databases, Proceedings of the IFIP TC 2\/WG 2.6 Working Conference on Visual Database Systems, North Holland (1989) 525\u2013546"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"S. Even, A. Itai, A. Shamir, On the complexity of Timetable and Multicommodity Flow Problems, SIAM Journal on Computing 5 (1976) 691\u2013703","journal-title":"SIAM Journal on Computing"},{"key":"31_CR3","unstructured":"M. Formann, Algorithms for Geometric Packing and Scaling Problems, Dissertation, Fachbereich Mathematik und Informatik, Freie Universit\u00e4t Berlin (1992)"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"M. Formann, F. Wagner, A Packing Problem with Applications to Lettering of Maps, Proceedings of the 7th Annual ACM Symposium on Computational Geometry (1991) 281\u2013288","DOI":"10.1145\/109648.109680"},{"key":"31_CR5","unstructured":"M. Formann, F. Wagner, An efficient solution to Knuth's METAFONT labeling problem, Manuscript (1993)"},{"key":"31_CR6","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1559\/152304075784313304","volume":"2","author":"E. Imhof","year":"1975","unstructured":"E. Imhof, Positioning Names on Maps, The American Cartographer 2 (1975) 128\u2013144","journal-title":"The American Cartographer"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1137\/0405033","volume":"5","author":"D. E. Knuth","year":"1992","unstructured":"D. E. Knuth And A. Raghunathan, The Problem of Compatible Representatives, SIAM Journal on Discrete Mathematics 5 (1992) 422\u2013427","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/204865.204889","volume":"38","author":"K. Mehlhorn","year":"1995","unstructured":"K. Mehlhorn and S. N\u00e4her, LEDA: a platform for combinatorial and geometric computing, Communications of the ACM 38 (1995) 96\u2013102","journal-title":"Communications of the ACM"},{"key":"31_CR9","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1137\/0215033","volume":"15","author":"H. Imai","year":"1986","unstructured":"H. Imai, T. Asano, Efficient Algorithms for Geometric Graph Search Problems, SIAM J. Comput. 15 (1986) 478\u2013494","journal-title":"SIAM J. Comput"},{"key":"31_CR10","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/3-540-56503-5_32","volume":"665","author":"L. Ku\u010dera","year":"1993","unstructured":"L. Ku\u010dera, K. Mehlhorn, B. Preis, E. Schwarzenecker, Exact Algorithms for a Geometric Packing Problem, Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 665 (1993) 317\u2013322","journal-title":"Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science"},{"key":"31_CR11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0020-0190(94)90001-9","volume":"52","author":"F. Wagner","year":"1994","unstructured":"F. WagnerApproximate Map Labeling is in \u03a9(n log n), Information Processing Letters 52 (1994) 161\u2013165","journal-title":"Information Processing Letters"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"F. Wagner, A. Wolff Map Labeling Heuristics: Provably Good and practically Useful, to appear in: Proceedings of the 11th Annual ACM Symposium on Computational Geometry (1995)","DOI":"10.1145\/220279.220291"},{"key":"31_CR13","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1006\/jsco.1994.1022","volume":"17","author":"G. Weber","year":"1994","unstructured":"G. Weber, L. Knipping, H. Alt, An Application of Point Pattern Matching in Astronautics, Journal of Symbolic Computation 17 (1994) 321\u2013340","journal-title":"Journal of Symbolic Computation"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60313-1_160.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:58:07Z","timestamp":1605646687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60313-1_160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603139","9783540449133"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-60313-1_160","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}