Combining traditional map labeling with boundary labeling

Bekos, MA; Kaufmann, M; Papadopoulos, D; Symvonis, A

dc.contributor.author	Bekos, MA	en
dc.contributor.author	Kaufmann, M	en
dc.contributor.author	Papadopoulos, D	en
dc.contributor.author	Symvonis, A	en
dc.date.accessioned	2014-03-01T02:47:19Z
dc.date.available	2014-03-01T02:47:19Z
dc.date.issued	2011	en
dc.identifier.issn	03029743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33068
dc.subject	Efficient Algorithm	en
dc.subject	Map Labeling	en
dc.subject	Polynomial Time	en
dc.subject.other	Boundary labeling	en
dc.subject.other	Efficient algorithm	en
dc.subject.other	Heuristics and approximations	en
dc.subject.other	Map-labeling	en
dc.subject.other	Maximization problem	en
dc.subject.other	Quasi-polynomial time	en
dc.subject.other	Algorithms	en
dc.subject.other	Polynomial approximation	en
dc.subject.other	Computer science	en
dc.title	Combining traditional map labeling with boundary labeling	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-642-18381-2_9	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-642-18381-2_9	en
heal.publicationDate	2011	en
heal.abstract	The traditional map labeling problems are mostly -hard. Hence, effective heuristics and approximations have been developed in the past. Recently, efficient algorithms for the so-called boundary labeling model have been introduced which assumes that the labels are placed on the boundary of the map and connected by polygonal leaders to their corresponding sites. Internal labels have been forbidden. In this paper, we allow both. Since clearly internal labels should be preferred, we consider several maximization problems for the number of internal labels and we show that they can be obtained efficiently or in quasi-polynomial time. © 2011 Springer-Verlag Berlin Heidelberg.	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
dc.identifier.doi	10.1007/978-3-642-18381-2_9	en
dc.identifier.volume	6543 LNCS	en
dc.identifier.spage	111	en
dc.identifier.epage	122	en