메뉴 건너뛰기




Volumn 8, Issue 6, 2000, Pages 775-784

On the cost of virtual private networks

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; HEURISTIC METHODS; INTRANETS; NETWORK PROTOCOLS; ROUTERS; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

EID: 0034467609     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.893873     Document Type: Article
Times cited : (31)

References (12)
  • 1
    • 0020717353 scopus 로고
    • Routing to multiple destinations in computer networks
    • Mar.
    • K. Bharath-Kumar and J. Jaffe, "Routing to multiple destinations in computer networks," IEEE Trans. Commun., vol. 31, pp. 343-351, Mar. 1983.
    • (1983) IEEE Trans. Commun. , vol.31 , pp. 343-351
    • Bharath-Kumar, K.1    Jaffe, J.2
  • 8
    • 0028514351 scopus 로고
    • On the hardness of approximating minimization problems
    • C. Lund and M. Yannakakis, "On the hardness of approximating minimization problems," J. Assoc. Comput. Mach., vol. 41, no. 5, pp. 960-981, 1994.
    • (1994) J. Assoc. Comput. Mach. , vol.41 , Issue.5 , pp. 960-981
    • Lund, C.1    Yannakakis, M.2
  • 9
    • 0029736257 scopus 로고    scopus 로고
    • An algorithm for multicast tree generation in networks with asymmetric links
    • San Francisco, CA, Mar.
    • S. Ramanathan, "An algorithm for multicast tree generation in networks with asymmetric links," in Proc. INFOCOM, San Francisco, CA, Mar. 1996, pp. 337-344.
    • (1996) Proc. INFOCOM , pp. 337-344
    • Ramanathan, S.1
  • 12
    • 0000133156 scopus 로고
    • An approximate solution for the Steiner problem in graphs
    • H. Takahashi and A. Matsuyama, "An approximate solution for the Steiner problem in graphs," Math. Japonica, vol. 24, pp. 573-577, 1980.
    • (1980) Math. Japonica , vol.24 , pp. 573-577
    • Takahashi, H.1    Matsuyama, A.2


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