Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

DOI10.1007/b11961zbMath1279.52013arXivmath/0306246OpenAlexW4298253479MaRDI QIDQ5900943

Anja Remshagen, Volker Kaibel

Publication date: 26 May 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0306246

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (2)

Expansion of random 0/1 polytopes ⋮ The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract)

This page was built for publication: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques