메뉴 건너뛰기




Volumn 2, Issue 3, 1998, Pages 257-288

Approximation Algorithms for Certain Network Improvement Problems

Author keywords

Approximation Algorithms; Complexity; NP hardness

Indexed keywords


EID: 0004734412     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009798010579     Document Type: Article
Times cited : (46)

References (27)
  • 2
    • 21144465703 scopus 로고
    • Improving the location of minisum facilities through network modification
    • O. Berman, "Improving the location of minisum facilities through network modification," Annals of Operations Research vol. 40, pp. 1-16, 1992.
    • (1992) Annals of Operations Research , vol.40 , pp. 1-16
    • Berman, O.1
  • 4
    • 38249035911 scopus 로고
    • Linear - Time Computation of Optimal Subgraphs of Decomposable Graphs
    • M. W. Bern, E. L. Lawler and A. L. Wong, "Linear - Time Computation of Optimal Subgraphs of Decomposable Graphs," Journal of Algorithms vol. 8, pp. 216-235, 1987.
    • (1987) Journal of Algorithms , vol.8 , pp. 216-235
    • Bern, M.W.1    Lawler, E.L.2    Wong, A.L.3
  • 6
    • 0002293349 scopus 로고
    • Matching, Euler tours and the Chinese postman
    • J. Edmonds and E. L. Johnson, "Matching, Euler tours and the Chinese postman," Mathematical Programming, vol. 5, 88-124, 1973.
    • (1973) Mathematical Programming , vol.5 , pp. 88-124
    • Edmonds, J.1    Johnson, E.L.2
  • 9
    • 0029289832 scopus 로고
    • A general approximation technique for constrained forest problems
    • M. W. Goemans and D. P. Williamson, "A general approximation technique for constrained forest problems," SIAM Journal on Computing vol. 24, pp. 296-317, 1995.
    • (1995) SIAM Journal on Computing , vol.24 , pp. 296-317
    • Goemans, M.W.1    Williamson, D.P.2
  • 10
    • 0027607736 scopus 로고
    • Approximating the minimum maximal independence number
    • M. M. Halldórsson, "Approximating the minimum maximal independence number," Information Processing Letters vol. 46, pp. 169-172, 1993.
    • (1993) Information Processing Letters , vol.46 , pp. 169-172
    • Halldórsson, M.M.1
  • 11
    • 0002777817 scopus 로고
    • Approximation schemes for the restricted shortest path problem
    • R. Hassin, "Approximation schemes for the restricted shortest path problem," Mathematics of Operations Research vol. 17, pp. 36-42, 1992.
    • (1992) Mathematics of Operations Research , vol.17 , pp. 36-42
    • Hassin, R.1
  • 12
    • 0041663816 scopus 로고    scopus 로고
    • Edge Weight Reduction Problems in Acyclic graphs
    • S. E. Hambrusch and H. Y. Tu, "Edge Weight Reduction Problems in Acyclic graphs," J. Algorithms vol. 24, pp. 66-93, 1997.
    • (1997) J. Algorithms , vol.24 , pp. 66-93
    • Hambrusch, S.E.1    Tu, H.Y.2
  • 13
    • 2342586466 scopus 로고    scopus 로고
    • Modifying Edges of a Network to Obtain Short Subgraphs
    • Accepted for publication
    • S. O. Krumke, H. Noltemeier, S. S. Ravi, M. V. Marathe, and K. U. Drangmeister, "Modifying Edges of a Network to Obtain Short Subgraphs," Accepted for publication in Theoretical Computer Science. (An extended abstract of this paper titled Modifying networks to obtain low cost trees appeared in Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science, Cadenabbia, Italy, Lecture Notes in Computer Science, June 1996, pp. 293-307.)
    • Theoretical Computer Science.
    • Krumke, S.O.1    Noltemeier, H.2    Ravi, S.S.3    Marathe, M.V.4    Drangmeister, K.U.5
  • 14
    • 84896748127 scopus 로고    scopus 로고
    • Modifying networks to obtain low cost trees appeared
    • An extended abstract of this paper titled Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science, Cadenabbia, Italy, June
    • S. O. Krumke, H. Noltemeier, S. S. Ravi, M. V. Marathe, and K. U. Drangmeister, "Modifying Edges of a Network to Obtain Short Subgraphs," Accepted for publication in Theoretical Computer Science. (An extended abstract of this paper titled Modifying networks to obtain low cost trees appeared in Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science, Cadenabbia, Italy, Lecture Notes in Computer Science, June 1996, pp. 293-307.)
    • (1996) Lecture Notes in Computer Science , pp. 293-307
  • 21
    • 0019536824 scopus 로고
    • The complexity of designing a network with minimum diameter
    • J. Plesnik, 'The complexity of designing a network with minimum diameter," Networks vol. 11, pp. 77-85, 1981.
    • (1981) Networks , vol.11 , pp. 77-85
    • Plesnik, J.1
  • 22
    • 21844522079 scopus 로고
    • Network upgrading problems
    • D. Paik and S. Sahni, "Network upgrading problems," Networks vol. 26, pp. 45-58, 1995.
    • (1995) Networks , vol.26 , pp. 45-58
    • Paik, D.1    Sahni, S.2
  • 24
    • 2342513238 scopus 로고
    • Ph.D. thesis, Brown University, Providence, Rhode Island 02912, USA
    • R. Ravi, Steiner trees and beyond, Ph.D. thesis, Brown University, Providence, Rhode Island 02912, USA, 1993.
    • (1993) Steiner Trees and Beyond
    • Ravi, R.1
  • 27
    • 0023207978 scopus 로고
    • Approximation of pareto optima in multiple-objective shortest path problems
    • A. Warburton, "Approximation of pareto optima in multiple-objective shortest path problems," Operations Research vol. 35, pp. 70-79, 1992.
    • (1992) Operations Research , vol.35 , pp. 70-79
    • Warburton, A.1


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