Pages that link to "Item:Q5096811"
From MaRDI portal
The following pages link to A combinatorial bound for linear programming and related problems (Q5096811):
Displayed 35 items.
- Random sampling in computational algebra: Helly numbers and violator spaces (Q277210) (← links)
- Backwards analysis of the Karger-Klein-Tarjan algorithm for minimum spanning trees (Q293385) (← links)
- Polynomial-time algorithms for energy games with special weight structures (Q487011) (← links)
- Covering points by disjoint boxes with outliers (Q617548) (← links)
- Combinatorial structure and randomized subexponential algorithms for infinite games (Q817809) (← links)
- Violator spaces: Structure and algorithms (Q943850) (← links)
- Removing degeneracy in LP-type problems revisited (Q1042446) (← links)
- Helly-type theorems and generalized linear programming (Q1338955) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Krein-Milman spaces (Q1792115) (← links)
- Output-sensitive results on convex hulls, extreme points, and related problems (Q1816463) (← links)
- Efficient algorithms for the minimum diameter bridge problem (Q1869735) (← links)
- On geometric optimization with few violated constraints (Q1906043) (← links)
- A short proof of an interesting Helly-type theorem (Q1913693) (← links)
- No dimension-independent core-sets for containment under homothetics (Q1942308) (← links)
- A dual simplex-type algorithm for the smallest enclosing ball of balls (Q2044498) (← links)
- Bipartite diameter and other measures under translation (Q2172648) (← 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)
- Violator spaces vs closure spaces (Q2311366) (← links)
- A characterization theorem and an algorithm for a convex hull problem (Q2341220) (← links)
- An optimal randomized algorithm for \(d\)-variate zonoid depth (Q2477199) (← links)
- Random edge can be exponential on abstract cubes (Q2496719) (← links)
- Helly’s theorem: New variations and applications (Q2979647) (← links)
- Removing degeneracy may require unbounded dimension increase (Q3503459) (← links)
- A Meeting Scheduling Problem Respecting Time and Space (Q3511415) (← links)
- Computing the Rectilinear Center of Uncertain Points in the Plane (Q4557735) (← links)
- Bounding Helly Numbers via Betti Numbers (Q4604384) (← links)
- Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization (Q4609983) (← links)
- Linear Time Algorithm for 1-Center in $$\mathfrak {R}^d$$ Under Convex Polyhedral Distance Function (Q4632168) (← links)
- Clustering in Hilbert’s Projective Geometry: The Case Studies of the Probability Simplex and the Elliptope of Correlation Matrices (Q4967762) (← links)
- Some Discrete Properties of the Space of Line Transversals to Disjoint Balls (Q5188768) (← links)
- Optimal Algorithms for Geometric Centers and Depth (Q5864667) (← links)
- Helly-type theorems for approximate covering (Q5896959) (← links)
- (Q6179337) (← links)