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

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.< >

Saved in:
Bibliographic Details
Main Authors: Watanabe, T., Mashima, T., Taoka, S.
Format: Conference Proceeding
Language:English
Subjects:
Approximation algorithms
Circuits and systems
Cost function
Greedy algorithms
Joining processes
Robustness
Systems engineering and theory
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.< >
DOI:10.1109/ISCAS.1993.394287