Approximating infeasible 2VPI-systems

DOI10.1007/978-3-642-34611-8_24MaRDI QIDQ5200510zbMATH OpenOpenAlexFDO

Authors Neele Leithäuser, Maximilian Merkert, Sven O. Krumke

Publication date 6 November 2012

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-34611-8_24

zbMATH Keywords

arboricity of a constraint graphshortest-path computation

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
• scientific article; zbMATH DE number 1405787
• scientific article; zbMATH DE number 3883605
• Efficient algorithms for integer programs with two variables per constraint.
• On solving Boolean combinations of UTVPI constraints.

This page was built for publication: Approximating infeasible 2VPI-systems

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