The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs

Chandra Chekuri, Alina Ene. The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs. In Jon Lee, Jens Vygen, editors, Integer Programming and Combinatorial Optimization - 17th International Conference, IPCO 2014, Bonn, Germany, June 22-24, 2014. Proceedings. Volume 8494 of Lecture Notes in Computer Science, pages 222-233, Springer, 2014. [doi]

@inproceedings{ChekuriE14,
  title = {The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs},
  author = {Chandra Chekuri and Alina Ene},
  year = {2014},
  doi = {10.1007/978-3-319-07557-0_19},
  url = {http://dx.doi.org/10.1007/978-3-319-07557-0_19},
  researchr = {https://researchr.org/publication/ChekuriE14},
  cites = {0},
  citedby = {0},
  pages = {222-233},
  booktitle = {Integer Programming and Combinatorial Optimization - 17th International Conference, IPCO 2014, Bonn, Germany, June 22-24, 2014. Proceedings},
  editor = {Jon Lee and Jens Vygen},
  volume = {8494},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-07556-3},
}