메뉴 건너뛰기




Volumn 5124 LNCS, Issue , 2008, Pages 258-269

Reoptimization of steiner trees

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; POLYNOMIAL APPROXIMATION; TECHNICAL PRESENTATIONS; TREES (MATHEMATICS);

EID: 54249130858     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69903-3_24     Document Type: Conference Paper
Times cited : (36)

References (8)
  • 1
    • 0024735782 scopus 로고
    • The Steiner problem with edge lengths 1 and 2
    • Bern, M.W., Plassmann, P.E.: The Steiner problem with edge lengths 1 and 2. Inf. Process. Lett. 32(4), 171-176 (1989)
    • (1989) Inf. Process. Lett , vol.32 , Issue.4 , pp. 171-176
    • Bern, M.W.1    Plassmann, P.E.2
  • 4
    • 84981632113 scopus 로고
    • The Steiner problem in graphs
    • Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1, 195-207 (1971/1972)
    • (1971) Networks , vol.1 , pp. 195-207
    • Dreyfus, S.E.1    Wagner, R.A.2
  • 5
    • 54249129547 scopus 로고    scopus 로고
    • Simple and fast reoptimizations for the Steiner tree problem
    • Technical Report 2007-01, DIMACS
    • Escoffier, B., Milanic, M., Paschos, V.T.: Simple and fast reoptimizations for the Steiner tree problem. Technical Report 2007-01, DIMACS (2007)
    • (2007)
    • Escoffier, B.1    Milanic, M.2    Paschos, V.T.3
  • 8
    • 0033881821 scopus 로고    scopus 로고
    • Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2000, pp. 770-779. ACM Press, New York (2000)
    • Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2000, pp. 770-779. ACM Press, New York (2000)


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