Pages that link to "Item:Q1923862"

The following pages link to A subexponential bound for linear programming (Q1923862):

Displaying 41 items.

• Randomized combinatorial algorithms for linear programming when the dimension is moderately high (Q2768279) (← 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)
• Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458) (← links)
• Removing degeneracy may require unbounded dimension increase (Q3503459) (← links)
• Linear programming by minimizing distances (Q3978454) (← links)
• Lower bounds for a subexponential optimization algorithm (Q4312749) (← links)
• The Random‐Facet simplex algorithm on combinatorial cubes (Q4537627) (← links)
• (Q4553289) (← links)
• Constant-Factor Approximation for TSP with Disks (Q4604382) (← links)
• Network Essence: PageRank Completion and Centrality-Conforming Markov Chains (Q4604398) (← links)
• Linear Time Algorithm for 1-Center in $$\mathfrak {R}^d$$ Under Convex Polyhedral Distance Function (Q4632168) (← links)
• APPROXIMATING 3D POINTS WITH CYLINDRICAL SEGMENTS (Q4652928) (← links)
• COMPUTING ROUNDNESS IS EASY IF THE SET IS ALMOST ROUND (Q4818558) (← links)
• THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS (Q4824662) (← 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)
• Algorithms for polytope covering and approximation (Q5060117) (← links)
• Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games (Q5089201) (← links)
• (Q5091276) (← links)
• A combinatorial bound for linear programming and related problems (Q5096811) (← links)
• (Q5111758) (← links)
• A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
• OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS (Q5305065) (← links)
• Optimal Triangulation with Steiner Points (Q5387801) (← links)
• Optimal Algorithms for Geometric Centers and Depth (Q5864667) (← links)
• Markov incremental constructions (Q5896960) (← links)
• Analysis of incomplete data and an intrinsic-dimension Helly theorem (Q5901492) (← links)
• Two-variable linear programming in parallel (Q5959558) (← links)
• Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965568) (← links)
• An exponential lower bound for Zadeh's pivot rule (Q6038661) (← links)
• Sectorial coverage control with load balancing in non-convex hollow environments (Q6049099) (← links)
• Simple linear time algorithms for piercing pairwise intersecting disks (Q6110069) (← links)
• Stabbing pairwise intersecting disks by four points (Q6142366) (← links)
• Cospanning characterizations of violator and co-violator spaces (Q6616810) (← links)