Many-to-one boundary labeling

Journal of Graph Algorithms and Applications

Volumn 12, Issue 3, 2008, Pages 319-356

  Lin, Chun Cheng ^a   Kao, Hao Jen ^a   Yen, Hsu Chun ^a,b  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b KAINAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY LABELING; CRITICAL DESIGN; CROSSING MINIMIZATION; DESIGN ISSUES; LABELING SCHEME; MANY-TO-ONE; MINIMIZATION PROBLEMS; MULTI-SITE; NP COMPLETE; STRAIGHT-LINE SEGMENTS;

APPROXIMATION ALGORITHMS;

EID: 70349858435     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00169     Document Type: Article

References (22)

1. M. Bekos, M. Kaufmann, K. Potika, and A. Symvonis. Boundary labelling of optimal total leader length. In Proceedings of the 10th Panhellenic Con-ference on Informatics (PCI 2005), volume 3746 of LNCS, pages 80-89, 2005.
2. M. Bekos, M. Kaufmann, K. Potika, and A. Symvonis. Polygons labelling of minimum leader length. In Proceedings of Asia Pacific Symposium on Information Visualisation 2006 (APVIS2006), volume 60 of CRPIT, pages 15-21, 2006.
3. M. Bekos, M. Kaufmann, A. Symvonis, and A. Wolff. Boundary labeling: models and efficient algorithms for rectangular maps. In Proceedings of the 12th International Symposium on Graph Drawing (GD 2004), volume 3383 of LNCS, pages 49-59, 2004.
4. M. Bekos, M. Kaufmann, A. Symvonis, and A. Wolff. Boundary labeling: models and efficient algorithms for rectangular maps. Computational Geometry: Theory and Applications, 36(3):215-236, 2006.
5. M. Bekos and A. Symvonis. BLer: a boundary labeller for technical drawings. In Proceedings of the 13th International Symposium on Graph Drawing (GD 2005), volume 3843 of LNCS, pages 503-504, 2006.
6. M. Benkert, H. Haverkort, M. Kroll, and M. N̈ollenburg. Algorithms for multi-criteria one-sided boundary labeling. In Proceedings of the 15th Inter-national Symposium on Graph Drawing (GD 2007), volume 4875 of LNCS, pages 243-254, 2008.
7. B. Chazelle and 36 co-authors. The computational geometry impact task force report. In B. Chazelle, J. E. Goodman, and R. Pollack, editors, Advances in Discrete and Computational Geometry, volume 223, pages 407-463. AMS, 1999.
8. P. Eades and N. C. Wormald. Edge crossings in drawings of bipartite graphs. Algorithmica, 11:379-403, 1994.
9. U. Feige and R. Krauthgamer. A polylogarithmic approximation of the minimum bisection. SIAM Review, 48(1):99-130, 2006.
10. U. Feige and O. Yahalom. On the complexity of finding balanced oneway cuts. Information Processing Letter, 87(1):1-5, 2003.
11. M. Formann and F. Wagner. A packing problem with applications to lettering of maps. In Proceedings of the 7th Annual ACM Symposium on Computational Geometry (SoCG 1991), pages 281-288. ACM Press, 1991.
12. M. R. Garey and D. S. Johnson. Computers and Interactability. A Guide to the Theory of NP-Completeness. A Series of Books in the Mathematical Sciences. Freemann And Company, 1979.
13. E. Imhof. Positioning names on maps. The American Cartographer, 2(2):128-144, 1975.
14. C. Iturriaga and A. Lubiw. NP-hardness of some map labeling problems. Technical Report CS-97-18, University of Waterloo, 1997.
15. B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49(2):291-307, 1970.
16. X. Munoz, W. Unger, and I. Vrt'o. One sided crossing minimization is NPhard for sparse graphs. In Proceedings of the 9th International Symposium on Graph Drawing (GD 2001), volume 2265 of LNCS, pages 115-123, 2002.
17. G. Neyer. Map labeling with application to graph drawing. In D. Wagner and M. Kaufman, editors, Drawing Graphs: Methods and Models, volume 2025 of LNCS, pages 247-273. 2001.
18. P. M. Vaidya. Geometry helps in matching. SIAM Journal on Computing, 18(6):1201-1225, 1989.
19. F. Wagner. Approximate map labeling is in (n log n). Information Pro-cessing Letter, 52(3):161-165, 1994.
20. F. Wagner and A. Wolff. Map labeling heuristics: provably good and practically useful. In Proceedings of the 11th Annual ACM Symposium on Computational Geometry (SoCG 1995), pages 109-118. ACM Press, 1995.
21. A. Wolff and T. Strijk. The map-labeling bibliography. http://i11www.ira.uka.de/map-labeling/bibliography/, 1996.
22. Y. Ye. A.699-approximation algorithm for max-bisection. Mathematical Programming, 90(1):101-111, 2001.