메뉴 건너뛰기




Volumn 2368, Issue , 2002, Pages 90-99

Exact algorithms and approximation schemes for base station placement problems

Author keywords

[No Author keywords available]

Indexed keywords

BASE STATIONS; COMPLEX NETWORKS; COMPUTATIONAL COMPLEXITY;

EID: 84943239716     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45471-3_10     Document Type: Conference Paper
Times cited : (15)

References (8)
  • 4
    • 0037952119 scopus 로고    scopus 로고
    • The complexity of base station positioning in cellular networks
    • Carleton Press
    • C. Glasser, S. Reith, and H. Vollmer. The complexity of base station positioning in cellular networks. In Proc. ICALP Workshops, 167–177. Carleton Press, 2000.
    • (2000) Proc. ICALP Workshops , pp. 167-177
    • Glasser, C.1    Reith, S.2    Vollmer, H.3
  • 5
    • 0021897852 scopus 로고
    • Approximation schemes for covering and packing problems in image processing and VLSI
    • D.S. Hochbaum and W. Maas. Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM, 32:130–136, 1985.
    • (1985) J. ACM , vol.32 , pp. 130-136
    • Hochbaum, D.S.1    Maas, W.2
  • 7
    • 0027147716 scopus 로고
    • The slab dividing approach to solve the Euclidian p-center problem
    • R.Z Hwang, R.C.T Lee, and R.C. Chang. The slab dividing approach to solve the Euclidian p-center problem. Algorithmica, 9:1–22, 1993.
    • (1993) Algorithmica , vol.9 , pp. 1-22
    • Hwang, R.Z.1    Lee, R.2    Chang, R.C.3
  • 8
    • 0018457301 scopus 로고
    • A separator theorem for planar graphs
    • April
    • R.J. Lipton and R.E. Tarjan. A separator theorem for planar graphs. SIAM J. on Applied Math., 36(2):177–189, April 1979.
    • (1979) SIAM J. On Applied Math , vol.36 , Issue.2 , pp. 177-189
    • Lipton, R.J.1    Tarjan, R.E.2


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