k-Violation Linear Programming

[1]  Kenneth L. Clarkson,et al.  Las Vegas algorithms for linear and integer programming when the dimension is small , 1995, JACM.

[2]  Hazel Everett,et al.  An optimal algorithm for the (≤ k)-levels, with applications to separation and transversal problems , 1993, SCG '93.

[3]  Micha Sharir,et al.  A subexponential bound for linear programming , 1992, SCG '92.

[4]  David M. Mount,et al.  A randomized algorithm for slope selection , 1992, Int. J. Comput. Geom. Appl..

[5]  Micha Sharir,et al.  A Combinatorial Bound for Linear Programming and Related Problems , 1992, STACS.

[6]  Endre Szemerédi,et al.  An upper bound on the number of planarK-sets , 1992, Discret. Comput. Geom..

[7]  Jirí Matousek,et al.  Randomized Optimal Algorithm for Slope Selection , 1991, Inf. Process. Lett..

[8]  Ketan Mulmuley,et al.  On levels in arrangements and voronoi diagrams , 1991, Discret. Comput. Geom..

[9]  Raimund Seidel,et al.  Linear programming and convex hulls made easy , 1990, SCG '90.

[10]  Ernst P. Mücke,et al.  Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1990, TOGS.

[11]  Endre Szemerédi,et al.  An Optimal-Time Algorithm for Slope Selection , 1989, SIAM J. Comput..

[12]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[13]  Herbert Edelsbrunner,et al.  Constructing Belts in Two-Dimensional Arrangements with Applications , 1986, SIAM J. Comput..

[14]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[15]  Richard Cole,et al.  On k-hulls and related problems , 1984, STOC '84.

[16]  Nimrod Megiddo,et al.  Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[17]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[18]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[19]  Nimrod Megiddo,et al.  Linear-Time Algorithms for Linear Programming in R^3 and Related Problems , 1982, FOCS.

[20]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .