Pages that link to "Item:Q5317180"

The following pages link to Low-Dimensional Linear Programming with Violations (Q5317180):

Displaying 22 items.

• Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
• Covering points by disjoint boxes with outliers (Q617548) (← links)
• Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495) (← links)
• Enclosing weighted points with an almost-unit ball (Q990963) (← links)
• A general approach for cache-oblivious range reporting and approximate range counting (Q991183) (← links)
• Coloring geometric range spaces (Q1017922) (← links)
• Algorithms for optimal outlier removal (Q1026234) (← links)
• Geometric path problems with violations (Q1709576) (← links)
• Shortest paths in the plane with obstacle violations (Q2182089) (← links)
• Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications (Q2207601) (← links)
• Approximation algorithms for the covering-type \(k\)-violation linear program (Q2329669) (← links)
• Separability of imprecise points (Q2362104) (← links)
• Nearest-neighbor searching under uncertainty. I (Q2411831) (← links)
• Dynamic minimum bichromatic separating circle (Q2424884) (← links)
• An optimal randomized algorithm for \(d\)-variate zonoid depth (Q2477199) (← links)
• Covering Linear Programming with Violations (Q2940540) (← links)
• Approximating the k-Level in Three-Dimensional Plane Arrangements (Q4604386) (← links)
• (Q5111738) (← links)
• Computing Shortest Paths in the Plane with Removable Obstacles (Q5116468) (← links)
• On approximate range counting and depth (Q5902137) (← links)
• Algorithms for Radon partitions with tolerance (Q5918766) (← links)
• Robust shape fitting via peeling and grating coresets (Q5920504) (← links)