Region growing for multi-route cuts

@inproceedings{Barman2010RegionGF,
  title={Region growing for multi-route cuts},
  author={Siddharth Barman and Shuchi Chawla},
  booktitle={SODA},
  year={2010}
}
We study a number of multi-route cut problems: given a graph G = (V, E) and connectivity thresholds k(u, v) on pairs of nodes, the goal is to find a minimum cost set of edges or vertices the removal of which reduces the connectivity between every pair (u, v) to strictly below its given threshold. These problems arise in the context of reliability in communication networks; They are natural generalizations of traditional minimum cut problems where the thresholds are either 1 (we want to… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-3 of 3 references

A method for obtaining the maximum multi-route flow in a network

  • W. Kishimoto
  • Networks
  • 1996
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…