Flow metrics
From MaRDI portal
Publication:596135
DOI10.1016/j.tcs.2003.05.003zbMath1067.68177OpenAlexW2911524555MaRDI QIDQ596135
Claudson F. Bornstein, Santosh Vempala
Publication date: 10 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2003.05.003
Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items
Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs, A New Lower Bound for the Minimum Linear Arrangement of a Graph, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometric algorithms and combinatorial optimization
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Geometry of cuts and metrics
