Flow metrics

DOI10.1016/J.TCS.2003.05.003MaRDI QIDQ596135zbMATH OpenOpenAlexFDO

Authors Claudson F. Bornstein, Santosh S. 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

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 2086253
• \(\ell ^2_2\) spreading metrics for vertex ordering problems
• New Approximation Techniques for Some Linear Ordering Problems
• scientific article; zbMATH DE number 1303559
• On approximability of linear ordering and related NP-optimization problems on graphs.

Cites work

• scientific article; zbMATH DE number 1261808 (Why is no real title available?)
• scientific article; zbMATH DE number 1303559 (Why is no real title available?)
• scientific article; zbMATH DE number 1833416 (Why is no real title available?)
• Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
• Geometric algorithms and combinatorial optimization
• Geometry of cuts and metrics
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
• Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems

Cited in

(4)

• scientific article; zbMATH DE number 2086253 (Why is no real title available?)
• Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs
• A New Lower Bound for the Minimum Linear Arrangement of a Graph
• Lower bounds for the minimum linear arrangement of a graph

This page was built for publication: Flow metrics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596135)