scientific article
From MaRDI portal
Publication:3140430
zbMath0808.90090MaRDI QIDQ3140430
Bernard Chazelle, Ji{ří} Matoušek
Publication date: 27 March 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)
Related Items (12)
Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements ⋮ Helly-type theorems and generalized linear programming ⋮ On the planar piecewise quadratic 1-center problem ⋮ On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids ⋮ On geometric optimization with few violated constraints ⋮ Almost optimal set covers in finite VC-dimension ⋮ Randomized geometric algorithms and pseudorandom generators ⋮ Optimal slope selection via cuttings ⋮ Diameter, width, closest line pair, and parametric searching ⋮ Two-variable linear programming in parallel ⋮ Two-variable linear programming in parallel ⋮ Minimum-volume enclosing ellipsoids and core sets
This page was built for publication:
