IEEE - Institute of Electrical and Electronics Engineers, Inc. - Approximation algorithms for minimum-cost augmentation to k-edge-connect a multigraph

1993 IEEE International Symposium on Circuits and Systems (ISCAS)

Author(s): T. Watanabe ; T. Mashima ; S. Taoka
Sponsor(s): IEEE
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 May 1993
Conference Location: Chicago, IL, USA
Conference Date: 3 May 1993
ISBN (Paper): 0-7803-1281-3
DOI: 10.1109/ISCAS.1993.394287
Regular:

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

Advertisement