Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs.
András A. BenczúrDavid R. KargerPublished in: SIAM J. Comput. (2015)
Keyphrases
- approximation schemes
- approximation algorithms
- network design problem
- np hard
- graph matching
- lot sizing
- facility location problem
- multi item
- bin packing
- facility location
- routing problem
- undirected graph
- single source
- error metrics
- spanning tree
- weighted graph
- vehicle routing problem
- directed graph
- object recognition
- numerical methods
- multiscale