Pages that link to "Item:Q1906043"
From MaRDI portal
The following pages link to On geometric optimization with few violated constraints (Q1906043):
Displaying 35 items.
- Enclosing \(k\) points in the smallest axis parallel rectangle (Q293194) (← links)
- Outlier respecting points approximation (Q517798) (← links)
- A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality (Q535064) (← links)
- Covering points by disjoint boxes with outliers (Q617548) (← links)
- Clarkson's algorithm for violator spaces (Q621918) (← links)
- On enclosing k points by a circle (Q674185) (← links)
- A streaming algorithm for 2-center with outliers in high dimensions (Q680151) (← links)
- Learning noisy functions via interval models (Q709215) (← links)
- Cause I'm a genial imprecise point: outlier detection for uncertain data (Q831712) (← links)
- Violator spaces: Structure and algorithms (Q943850) (← links)
- Interval predictor models: identification and reliability (Q1012735) (← links)
- Algorithms for optimal outlier removal (Q1026234) (← links)
- Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation (Q1041762) (← links)
- Removing degeneracy in LP-type problems revisited (Q1042446) (← links)
- Geometric applications of posets (Q1276942) (← links)
- \(k\)-violation linear programming (Q1336744) (← links)
- The ``point'' goalie problem (Q1422233) (← links)
- Computing a minimum-width square or rectangular annulus with outliers (Q1624585) (← links)
- Geometric path problems with violations (Q1709576) (← links)
- On the \(k\)-colored rainbow sets in fixed dimensions (Q2150582) (← links)
- Shortest paths in the plane with obstacle violations (Q2182089) (← links)
- Robust fitting in computer vision: easy or hard? (Q2193856) (← links)
- Approximating points by a piecewise linear function (Q2375945) (← links)
- Placing two axis-parallel squares to maximize the number of enclosed points (Q2792797) (← links)
- Computing a Minimum-Width Square or Rectangular Annulus with Outliers (Q2817885) (← links)
- Geometric constraints in descent methods for shape optimisation (Q3133560) (← links)
- Removing degeneracy may require unbounded dimension increase (Q3503459) (← links)
- Computing the Smallest T-Shaped Polygon Containing k Points (Q4780527) (← links)
- COMPUTING ROUNDNESS IS EASY IF THE SET IS ALMOST ROUND (Q4818558) (← links)
- Geometric Applications of Posets (Q5096956) (← 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)
