Pages that link to "Item:Q4369872"
From MaRDI portal
The following pages link to Las Vegas algorithms for linear and integer programming when the dimension is small (Q4369872):
Displaying 35 items.
- On polynomial kernels for sparse integer linear programs (Q269481) (← links)
- Random sampling in computational algebra: Helly numbers and violator spaces (Q277210) (← links)
- Optimal partition trees (Q420575) (← links)
- Clarkson's algorithm for violator spaces (Q621918) (← links)
- A Newton method for linear programming (Q704747) (← links)
- Provably fast training algorithms for support vector machines (Q927401) (← links)
- Unique sink orientations of grids (Q930596) (← links)
- Violator spaces: Structure and algorithms (Q943850) (← links)
- Practical methods for shape fitting and kinetic data structures using coresets (Q1006384) (← links)
- Linear programming, the simplex algorithm and simple polytopes (Q1365056) (← links)
- Enumerating a subset of the integer points inside a Minkowski sum (Q1602946) (← links)
- Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem (Q1707415) (← links)
- A quantitative Doignon-Bell-Scarf theorem (Q1743170) (← links)
- A linear algorithm for integer programming in the plane (Q1771307) (← links)
- A short proof of an interesting Helly-type theorem (Q1913693) (← links)
- A subexponential bound for linear programming (Q1923862) (← links)
- The 2-center problem in three dimensions (Q1947989) (← links)
- Polyhedral circuits and their applications (Q2039640) (← links)
- Bipartite diameter and other measures under translation (Q2172648) (← links)
- Random sampling with removal (Q2207595) (← links)
- Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
- A space decomposition-based deterministic algorithm for solving linear optimization problems (Q2306623) (← links)
- Testing proximity to subspaces: approximate \(\ell_\infty\) minimization in constant time (Q2309471) (← links)
- Streaming algorithms for extent problems in high dimensions (Q2345940) (← links)
- Tight bounds on discrete quantitative Helly numbers (Q2360726) (← links)
- On the planar piecewise quadratic 1-center problem (Q2379920) (← links)
- Quantitative Tverberg theorems over lattices and other discrete sets (Q2408215) (← links)
- An optimal randomized algorithm for \(d\)-variate zonoid depth (Q2477199) (← links)
- Distance problems within Helly graphs and \(k\)-Helly graphs (Q2682928) (← links)
- Helly’s theorem: New variations and applications (Q2979647) (← links)
- (Q3305368) (← links)
- Two-variable linear programming in parallel (Q5054853) (← links)
- (Q5090454) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- (Q5881551) (← links)
