Flow metrics

DOI10.1016/J.TCS.2003.05.003zbMATH Open1067.68177OpenAlexW2911524555MaRDI QIDQ596135FDOQ596135

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

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.

Mathematics Subject Classification ID

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

Cites Work

• 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
• Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
• Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Title not available (Why is that?)
• 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)