A Subexponential Algorithm for Abstract Optimization Problems

This publication has 16 references indexed in Scilit:

• Las Vegas algorithms for linear and integer programming when the dimension is small
  Journal of the ACM, 1995
• A SUBEXPONENTIAL RANDOMIZED ALGORITHM FOR THE SIMPLE STOCHASTIC GAME PROBLEM
  Information and Computation, 1995
• The complexity of stochastic games
  Information and Computation, 1992
• Geometric Algorithms and Combinatorial Optimization
  Published by Springer Nature ,1988
• The d-Step Conjecture and Its Relatives
  Mathematics of Operations Research, 1987
• New applications of random sampling in computational geometry
  Discrete & Computational Geometry, 1987
• On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
  SIAM Journal on Computing, 1986
• Linear programming in O(n × 3d) time
  Information Processing Letters, 1986
• A new polynomial-time algorithm for linear programming
  Combinatorica, 1984
• Polynomial algorithms in linear programming
  USSR Computational Mathematics and Mathematical Physics, 1980