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

Takahiro Watanabe, Toshiya Mashima, Satoshi Taoka · 1993 IEEE International Symposium on Circuits and Systems · 2002

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

Read the paper · More papers on PaperTik