Removing degeneracy in LP-type problems revisited

DOI10.1007/s00454-008-9085-7zbMath1180.90276OpenAlexW2057161916MaRDI QIDQ1042446

Ji{ří} Matoušek

Publication date: 14 December 2009

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-008-9085-7

zbMATH Keywords

combinatorial dimension

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27)

Related Items (2)

Clarkson's algorithm for violator spaces ⋮ Random sampling with removal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The clique complex and hypergraph matching
• d-collapsing and nerves of families of convex sets
• Domination numbers and homology
• Complexes of directed trees
• On geometric optimization with few violated constraints
• The topology of the independence complex
• A combinatorial bound for linear programming and related problems
• Violator Spaces: Structure and Algorithms

This page was built for publication: Removing degeneracy in LP-type problems revisited