Clarkson's algorithm for violator spaces

DOI10.1016/j.comgeo.2010.09.003zbMath1214.65034OpenAlexW2153170611MaRDI QIDQ621918

Bernd Gärtner, Yves Brise

Publication date: 31 January 2011

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2010.09.003

zbMATH Keywords

linear programmingClarkson's algorithmhypercube partitionLP-type problemviolator space

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (3)

Random sampling with removal ⋮ A space decomposition-based deterministic algorithm for solving linear optimization problems ⋮ Violator spaces vs closure spaces

Cites Work

• Violator spaces: Structure and algorithms
• Removing degeneracy in LP-type problems revisited
• On geometric optimization with few violated constraints
• A subexponential bound for linear programming
• Las Vegas algorithms for linear and integer programming when the dimension is small
• Linear programming — Randomization and abstract frameworks
• A Subexponential Algorithm for Abstract Optimization Problems
• A simple sampling lemma: Analysis and applications in geometric optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Clarkson's algorithm for violator spaces