scientific article; zbMATH DE number 2086253

zbMATH Open1059.90520MaRDI QIDQ3044352FDOQ3044352

Authors: Claudson F. Bornstein, Santosh S. Vempala 

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2286/22860516.htm

Title of this publication is not available (Why is that?)

Recommendations

• Flow metrics
• \(\ell ^2_2\) spreading metrics for vertex ordering problems
• New Approximation Techniques for Some Linear Ordering Problems
• scientific article; zbMATH DE number 1303559
• Divide-and-conquer approximation algorithms via spreading metrics

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (3)

• Flow metrics
• On integer linear programs for treewidth based on perfect elimination orderings
• \(\ell ^2_2\) spreading metrics for vertex ordering problems

This page was built for publication:

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