• DocumentCode
    2614226
  • Title

    Approximation algorithms for minimum-cost augmentation to k-edge-connect a multigraph

  • Author

    Watanabe, Toshimasa ; Mashima, Toshiya ; Taoka, Satoshi

  • Author_Institution
    Dept. of Circuits & Syst., Hiroshima Univ., Japan
  • fYear
    1993
  • fDate
    3-6 May 1993
  • Firstpage
    2556
  • Abstract
    The weighted R-edge-connectivity problem, in which there are distinct edge costs, is treated. Four approximation algorithms are proposed, and both theoretical and experimental evaluation of their approximate solutions are given
  • Keywords
    approximation theory; graph theory; approximation algorithms; edge costs; k-edge-connect; minimum-cost augmentation; multigraph; weighted R-edge-connectivity problem; Approximation algorithms; Circuits and systems; Cost function; Greedy algorithms; Joining processes; Robustness; Systems engineering and theory;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1993., ISCAS '93, 1993 IEEE International Symposium on
  • Conference_Location
    Chicago, IL
  • Print_ISBN
    0-7803-1281-3
  • Type

    conf

  • DOI
    10.1109/ISCAS.1993.394287
  • Filename
    394287
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2614226