Download:
|
by Bernd G Artner, Emo Welzl
http://www.inf.ethz.ch/personal/gaertner/texts/own_work/sampling_scg00.ps.gz
Add To MetaCart
Abstract:
Random sampling is an efficient method to deal with constrained optimization problems in computational geometry. In a first step, one finds the optimal solution subject to a random subset of the constraints; in many cases, the expected number of constraints still violated by that solution is then significantly smaller than the overall number of constraints that remain. This phenomenon can be exploited in several ways, and typically results in simple and asymptotically fast algorithms. Very often the analysis of random sampling in this context boils down to a simple identity (the sampling lemma) which holds in an amazingly general framework, yet has not explicitly been stated in the literature. In the more restricted but still general setting of LP-type problems, we prove tail estimates for the sampling lemma, giving Chernoff-type bounds for the number of constraints violated by the solution of a random subset. As an application, we provide the first theoretical analysis of multiple pricing, a heuristic used in the simplex method for linear programming in order to reduce a large problem to only few small ones. This follows from our analysis of a reduction scheme for general LP-type problems, which can be considered as a simplification of algorithms by Clarkson [6] as well as Adler and Shamir [1]. The simplified version needs less random resources and allows a Chernoff-type tail estimate.
Citations
|
5970
|
Introduction to Algorithm
– Cormen, Leiserson, et al.
|
|
581
|
Computational Geometry: Algorithms and Applications
– Berg, Kreveld, et al.
- 1997
|
|
378
|
Concrete Mathematics
– Graham, Knuth, et al.
- 1990
|
|
348
|
New applications of random sampling in computational geometry
– Clarkson
- 1987
|
|
283
|
Computational Geometry: An Introduction through Randomized Algorithms
– Mulmuley
- 1994
|
|
190
|
Small-dimensional linear programming and convex hulls made easy
– Seidel
- 1991
|
|
168
|
A guided tour of Chernoff bounds
– Hagerup, Rub
- 1989
|
|
132
|
Randomized incremental construction of Delaunay and Voronoi diagrams
– Guibas, Knuth, et al.
- 1992
|
|
126
|
A subexponential bound for linear programming
– Matouˇsek, Sharir, et al.
- 1996
|
|
82
|
Las Vegas algorithms for linear and integer programming when the dimension is small
– Clarkson
- 1995
|
|
74
|
A combinatorial bound for linear programming and related problems
– Sharir, Welzl
- 1992
|
|
62
|
Backwards analysis of randomized geometric algorithms
– Seidel
- 1993
|
|
37
|
On geometric optimization with few violated constraints
– Matoušek
- 1995
|
|
35
|
R.: Über die konvexe Hülle von n zufällig gewählten Punkten
– Rényi, Sulanke
- 1963
|
|
34
|
A randomized scheme for speeding up algorithms for linear and convex programming with high constraints-to-variable ratio
– Adler, Shamir
- 1993
|
|
33
|
Very large-scale linear programming: A case study in combining interior point and simplex methods
– Bixby, Gregory, et al.
- 1992
|
|
18
|
Linear programming – randomization and abstract frameworks
– Gärtner, Welzl
- 1996
|
|
10
|
A bound on local minima of arrangements that implies the upper bound theorem
– Clarkson
- 1993
|
|
9
|
An efficient, exact, and generic quadratic programming solver for geometric optimization
– Gärtner, Schönherr
- 2000
|
|
8
|
Exact arithmetic at low cost – a case study in linear programming
– Gartner
- 1999
|
|
6
|
Randomized Optimization by Simplex-Type Methods
– Gartner
- 1995
|
|
6
|
On the expected complexity of random convex hulls
– Har-Peled
- 1998
|
|
2
|
Great(er) expectations
– Dubhashi, Ranjan
- 1996
|
