Bounded-independance derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming

DOI10.1007/PL00009325zbMath0894.90109OpenAlexW1980711076MaRDI QIDQ1380803

Michael T. Goodrich, Edgar A. Ramos

Publication date: 11 March 1998

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

Full work available at URL: https://doi.org/10.1007/pl00009325

zbMATH Keywords

\(\varepsilon\)-net\(\varepsilon\)-approximationsgeometric partitioning problemsrange spaces with bounded VC-exponent

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)

Related Items (3)

Unnamed Item ⋮ Two-variable linear programming in parallel ⋮ Two-variable linear programming in parallel

This page was built for publication: Bounded-independance derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming