Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs

András A. Benczúr, David R. Karger. Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs. SIAM Journal on Computing, 44(2):290-319, 2015. [doi]

@article{BenczurK15,
  title = {Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs},
  author = {András A. Benczúr and David R. Karger},
  year = {2015},
  doi = {10.1137/070705970},
  url = {http://dx.doi.org/10.1137/070705970},
  researchr = {https://researchr.org/publication/BenczurK15},
  cites = {0},
  citedby = {0},
  journal = {SIAM Journal on Computing},
  volume = {44},
  number = {2},
  pages = {290-319},
}