Approximate Edge Splitting (2001) [1 citations — 0 self]
Download:
|
|
by Michel X. Goemans
SIAM J. Discrete Mathematics
http://www-math.mit.edu/~goemans/splitting.ps
Add To MetaCart
Abstract:
We show that, in any undirected graph, splitting off can be performed while preserving all cuts of value at most 4/3 times the minimum value, and this is best possible. This generalizes a classical splitting-off result of Lov'asz. 1
Citations
| 184 | Combinatorial Problems and Exercises – Lovász - 1993 |
| 73 | Augmenting Graphs to Meet Edge-Connectivity Requirements – Frank - 1992 |
| 58 | Connectivity augmentation problems in network design, in: Mathematical Programming: State of the Art 1994 – Frank - 1994 |
| 20 | Computing all small cuts in undirected networks – Nagamochi, Nishimura, et al. - 1997 |
| 10 | Ramakrishnan: Minimizing submodular functions over families of subsets – Goemans, Ramakrishnan - 1995 |
| 5 | Cut structures and randomized algorithms in edge-connectivity problems – Bencz'ur - 1997 |
| 2 | A reduction method for edge connectivity in graphs – Mader - 1978 |
