메뉴 건너뛰기




Volumn 380 LNCS, Issue , 1989, Pages 405-415

Approximation algorithms for channel assignment in cellular radio networks

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; MOBILE TELECOMMUNICATION SYSTEMS; POLYNOMIAL APPROXIMATION; RADIO COMMUNICATION;

EID: 80052792730     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-51498-8_39     Document Type: Conference Paper
Times cited : (6)

References (10)
  • 1
    • 0019573312 scopus 로고
    • Optimal packing and covering in the plane are NP-complete
    • June
    • R. J. Fowler, M. S. Paterson, and S. L. Tanimoto. Optimal packing and covering in the plane are NP-complete. Information Processing Lett., 12(3):133-137, June 1981.
    • (1981) Information Processing Lett. , vol.12 , Issue.3 , pp. 133-137
    • Fowler, R.J.1    Paterson, M.S.2    Tanimoto, S.L.3
  • 3
    • 30244473678 scopus 로고
    • Some simplified NP-complete graph problems
    • M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theor. Comput. Sci., 1(3):237-267, 1976.
    • (1976) Theor. Comput. Sci , vol.1 , Issue.3 , pp. 237-267
    • Garey, M.R.1    Johnson, D.S.2    Stockmeyer, L.3
  • 4
    • 85037532816 scopus 로고
    • unpublished
    • F. Gavril. 1974. unpublished.
    • (1974)
    • Gavril, F.1
  • 5
    • 0020908373 scopus 로고
    • A graph theoretical analysis of dynamic channel assignment algorithms for mobile radiocommunication systems
    • M. Grevel and A. Sachs. A graph theoretical analysis of dynamic channel assignment algorithms for mobile radiocommunication systems. Siemens Forsch. — u. Entwickl. — Ber., 12(5):298-305, 1983.
    • (1983) Siemens Forsch. — U. Entwickl. — Ber , vol.12 , Issue.5 , pp. 298-305
    • Grevel, M.1    Sachs, A.2
  • 6
    • 0021897852 scopus 로고
    • Approximation schemes for covering and packing problems in image processing and VLSI
    • D. S. Hochbaum and W. Maass. Approximation schemes for covering and packing problems in image processing and VLSI. J. Assoc. Comput. Mach., 32(1):130-136, 1985.
    • (1985) J. Assoc. Comput. Mach. , vol.32 , Issue.1 , pp. 130-136
    • Hochbaum, D.S.1    Maass, W.2
  • 7
    • 0016349356 scopus 로고
    • Approximation algorithms for combinatorial problems
    • D. S. Johnson. Approximation algorithms for combinatorial problems. J. Comp. System Sci., 9(3):256-278, 1974.
    • (1974) J. Comp. System Sci. , vol.9 , Issue.3 , pp. 256-278
    • Johnson, D.S.1
  • 9
    • 0016973706 scopus 로고
    • P-complete approximation problems
    • S. Sahni and T. Gonzales. P-complete approximation problems. J. Assoc. Comput. Mach., 23(3):555-565, 1976.
    • (1976) J. Assoc. Comput. Mach. , vol.23 , Issue.3 , pp. 555-565
    • Sahni, S.1    Gonzales, T.2


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