Low-Dimensional Linear Programming with Violations
From MaRDI portal
Publication:5317180
DOI10.1137/S0097539703439404zbMath1075.68092MaRDI QIDQ5317180
Publication date: 16 September 2005
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (22)
Separability of imprecise points ⋮ Covering Linear Programming with Violations ⋮ Nearest-neighbor searching under uncertainty. I ⋮ Shortest paths in the plane with obstacle violations ⋮ Covering points by disjoint boxes with outliers ⋮ Dynamic minimum bichromatic separating circle ⋮ Minimizing the error of linear separators on linearly inseparable data ⋮ Approximating the k-Level in Three-Dimensional Plane Arrangements ⋮ Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications ⋮ Geometric path problems with violations ⋮ On approximate range counting and depth ⋮ An optimal randomized algorithm for \(d\)-variate zonoid depth ⋮ Algorithms for Radon partitions with tolerance ⋮ Enclosing weighted points with an almost-unit ball ⋮ A general approach for cache-oblivious range reporting and approximate range counting ⋮ Optimal deterministic algorithms for 2-d and 3-d shallow cuttings ⋮ Unnamed Item ⋮ Coloring geometric range spaces ⋮ Robust shape fitting via peeling and grating coresets ⋮ Algorithms for optimal outlier removal ⋮ Approximation algorithms for the covering-type \(k\)-violation linear program ⋮ Computing Shortest Paths in the Plane with Removable Obstacles
This page was built for publication: Low-Dimensional Linear Programming with Violations
