메뉴 건너뛰기




Volumn 6543 LNCS, Issue , 2011, Pages 111-122

Combining traditional map labeling with boundary labeling

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY LABELING; EFFICIENT ALGORITHM; HEURISTICS AND APPROXIMATIONS; MAP-LABELING; MAXIMIZATION PROBLEM; QUASI-POLYNOMIAL TIME;

EID: 78751671023     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-18381-2_9     Document Type: Conference Paper
Times cited : (20)

References (20)
  • 1
    • 0242269918 scopus 로고    scopus 로고
    • Efficient algorithms for integer programs with two variables per constraint (extended abstract)
    • Bar-Yehuda, R., Rawitz, D.: Efficient algorithms for integer programs with two variables per constraint (extended abstract). Algorithmica 29(44), 595-609 (2001)
    • (2001) Algorithmica , vol.29 , Issue.44 , pp. 595-609
    • Bar-Yehuda, R.1    Rawitz, D.2
  • 3
    • 49949103730 scopus 로고    scopus 로고
    • Multi-stack boundary labeling problems
    • Arun-Kumar, S., Garg, N. (eds.), FSTTCS 2006, Springer, Heidelberg
    • Bekos, M.A., Kaufmann, M., Potika, K., Symvonis, A.: Multi-Stack Boundary Labeling Problems. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 81-92. Springer, Heidelberg (2006)
    • (2006) LNCS , vol.4337 , pp. 81-92
    • Bekos, M.A.1    Kaufmann, M.2    Potika, K.3    Symvonis, A.4
  • 6
    • 49949107464 scopus 로고    scopus 로고
    • Algorithms for multi-criteria one-sided boundary labeling
    • Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007, Springer, Heidelberg
    • Benkert, M., Haverkort, H., Kroll, M., Nöllenburg, M.: Algorithms for multi-criteria one-sided boundary labeling. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 243-254. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.4875 , pp. 243-254
    • Benkert, M.1    Haverkort, H.2    Kroll, M.3    Nöllenburg, M.4
  • 8
    • 0004634724 scopus 로고
    • Dynamic data structures for orthogonal intersection queries
    • Tech. Univ. Graz, Institute für Informationsverarbeitung
    • Edelsbrunner, H.: Dynamic data structures for orthogonal intersection queries. Tech. Rep. F59, Tech. Univ. Graz, Institute für Informationsverarbeitung (1980)
    • (1980) Tech. Rep. F59
    • Edelsbrunner, H.1
  • 11
    • 0027070260 scopus 로고
    • A bounded approximation for the minimum cost 2-Sat problem
    • Gusfield, D., Pitt, L.: A bounded approximation for the minimum cost 2-Sat problem. Algorithmica 8(2), 103-117 (1992)
    • (1992) Algorithmica , vol.8 , Issue.2 , pp. 103-117
    • Gusfield, D.1    Pitt, L.2
  • 14
    • 84947764594 scopus 로고
    • Exact algorithms for a geometric packing problem
    • Enjalbert, P., Wagner, K.W., Finkel, A. (eds.) STACS 1993, Springer, Heidelberg
    • Kucera, L., Mehlhorn, K., Preis, B., Schwarzenecker, E.: Exact algorithms for a geometric packing problem. In: Enjalbert, P., Wagner, K.W., Finkel, A. (eds.) STACS 1993. LNCS, vol. 665, pp. 317-322. Springer, Heidelberg (1993)
    • (1993) LNCS , vol.665 , pp. 317-322
    • Kucera, L.1    Mehlhorn, K.2    Preis, B.3    Schwarzenecker, E.4
  • 15
    • 77951680820 scopus 로고    scopus 로고
    • Crossing-free many-to-one boundary labeling with hyperleaders
    • IEEE Press, Los Alamitos
    • Lin, C.-C.: Crossing-free many-to-one boundary labeling with hyperleaders. In: 3rd IEEE Pacific Visualization Symposium (PacificVis 2010), pp. 185-192. IEEE Press, Los Alamitos (2010)
    • (2010) 3rd IEEE Pacific Visualization Symposium (PacificVis 2010) , pp. 185-192
    • Lin, C.-C.1
  • 20
    • 0022878480 scopus 로고
    • Integer programming applied to the map label placement problem
    • Zoraster, S.: Integer programming applied to the map label placement problem. Cartographica 23(3), 16-27 (1986)
    • (1986) Cartographica , vol.23 , Issue.3 , pp. 16-27
    • Zoraster, S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.