Approximating Requirement Cut via a Configuration LP
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2119718 (Why is no real title available?)
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
- An improved approximation algorithm for requirement cut
- An improved approximation algorithm of MULTIWAY CUT.
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- Approximation Algorithms for Steiner and Directed Multicuts
- Approximation algorithms for requirement cut on graphs
- Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
- Euclidean distortion and the sparsest cut
- Finding k Cuts within Twice the Optimal
- Fréchet embeddings of negative type metrics
- Geometry of cuts and metrics
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Multiway cut, pairwise realizable distributions, and descending thresholds
- Simplex partitioning via exponential clocks and the multiway-cut problem
- Simplex transformations and the multiway cut problem
- The Complexity of Multiterminal Cuts
- The Steiner k-Cut Problem
- The geometry of graphs and some of its algorithmic applications
- The multi-multiway cut problem
- Tree packing and approximating k-cuts
Cited in
(2)
This page was built for publication: Approximating Requirement Cut via a Configuration LP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6084417)
