Removing degeneracy may require unbounded dimension increase

DOI10.1016/J.ENDM.2007.07.019MaRDI QIDQ3503459zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 5899260
• Removing degeneracy in LP-type problems revisited
• A General Approach to Removing Degeneracies
• Removing degeneracies by perturbing the problem or perturbing the world
• scientific article; zbMATH DE number 1003230

Cites work

• A combinatorial bound for linear programming and related problems
• A geometric consistency theorem for a symbolic perturbation scheme
• A subexponential bound for linear programming
• Helly-type theorems and generalized linear programming
• scientific article; zbMATH DE number 1003230 (Why is no real title available?)
• scientific article; zbMATH DE number 1962853 (Why is no real title available?)
• On geometric optimization with few violated constraints
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Violator Spaces: Structure and Algorithms

Cited in

(4)

• Sampling with removal in LP-type problems
• scientific article; zbMATH DE number 5899260 (Why is no real title available?)
• Degeneracy: Resolve or Avoid?
• Sampling with removal in LP-type problems

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

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