Removing degeneracy may require unbounded dimension increase

DOI10.1016/j.endm.2007.07.019zbMath1341.05244OpenAlexW1981035142MaRDI QIDQ3503459

P. Škovroň, Ji{ří} Matoušek

Publication date: 5 June 2008

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2007.07.019

zbMATH Keywords

degeneracygeneral positionLP-type problems

Mathematics Subject Classification ID

Linear programming (90C05) Graph theory (05C99)

Cites Work

• Unnamed Item
• Unnamed Item
• A geometric consistency theorem for a symbolic perturbation scheme
• Helly-type theorems and generalized linear programming
• On geometric optimization with few violated constraints
• A subexponential bound for linear programming
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• A combinatorial bound for linear programming and related problems
• Violator Spaces: Structure and Algorithms

This page was built for publication: Removing degeneracy may require unbounded dimension increase