Pages that link to "Item:Q1923862"
From MaRDI portal
The following pages link to A subexponential bound for linear programming (Q1923862):
Displaying 50 items.
- Random sampling in computational algebra: Helly numbers and violator spaces (Q277210) (← links)
- Exact primitives for smallest enclosing ellipses (Q293400) (← links)
- The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs (Q477199) (← links)
- Polynomial-time algorithms for energy games with special weight structures (Q487011) (← links)
- An exponential lower bound for Cunningham's rule (Q507321) (← links)
- Clarkson's algorithm for violator spaces (Q621918) (← links)
- Geometric matching algorithms for two realistic terrains (Q683754) (← links)
- On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes (Q713305) (← links)
- Combinatorial structure and randomized subexponential algorithms for infinite games (Q817809) (← links)
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games (Q867862) (← links)
- Unique sink orientations of grids (Q930596) (← links)
- Violator spaces: Structure and algorithms (Q943850) (← links)
- Cyclic games and linear programming (Q944703) (← links)
- Optimal location of transportation devices (Q945946) (← links)
- Voronoi diagrams with respect to criteria on vision information (Q946853) (← links)
- Helly-type theorems and generalized linear programming (Q1338955) (← links)
- Combinatorial redundancy detection (Q1657399) (← links)
- A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane (Q1744887) (← links)
- Optimizing squares covering a set of points (Q1749537) (← links)
- On geometric optimization with few violated constraints (Q1906043) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
- No dimension-independent core-sets for containment under homothetics (Q1942308) (← links)
- The 2-center problem in three dimensions (Q1947989) (← links)
- Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints (Q2181246) (← links)
- Random sampling with removal (Q2207595) (← links)
- Piercing pairwise intersecting geodesic disks (Q2230402) (← links)
- Largest bounding box, smallest diameter, and related problems on imprecise points (Q2269143) (← links)
- Violator spaces vs closure spaces (Q2311366) (← links)
- The complexity of optimization on grids (Q2319631) (← links)
- A non-iterative algorithm for generalized pig games (Q2319668) (← links)
- A characterization theorem and an algorithm for a convex hull problem (Q2341220) (← links)
- Streaming algorithms for extent problems in high dimensions (Q2345940) (← links)
- Geometric random edge (Q2364496) (← links)
- Optimization-based mesh correction with volume and convexity constraints (Q2375084) (← links)
- On the planar piecewise quadratic 1-center problem (Q2379920) (← links)
- On the smallest enclosing information disk (Q2380049) (← links)
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension (Q2391831) (← links)
- Algorithms for bivariate zonoid depth (Q2456661) (← links)
- A simple linear algorithm for computing rectilinear 3-centers (Q2486079) (← links)
- Random edge can be exponential on abstract cubes (Q2496719) (← links)
- QUANTILE APPROXIMATION FOR ROBUST STATISTICAL ESTIMATION AND k-ENCLOSING PROBLEMS (Q2708040) (← links)
- Linear Time Algorithms for Euclidean 1-Center in $$\mathfrak {R}^d$$ with Non-linear Convex Constraints (Q2795940) (← links)
- Deterministic Algorithms for Unique Sink Orientations of Grids (Q2817878) (← links)
- Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls (Q2948466) (← links)
- Helly’s theorem: New variations and applications (Q2979647) (← links)
- A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games (Q3009763) (← links)
- Solving Linear Programming with Constraints Unknown (Q3448779) (← links)
- Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
- The Theory of Universal Graphs for Infinite Duration Games (Q5043588) (← links)
- Two-variable linear programming in parallel (Q5054853) (← links)
