DMCA
Randomized algorithms for geometric optimization problems (2001)
Cached
Download Links
| Venue: | Handbook of Randomized Computation |
| Citations: | 11 - 0 self |
BibTeX
@INPROCEEDINGS{Agarwal01randomizedalgorithms,
author = {Pankaj K. Agarwal and Sandeep Sen},
title = {Randomized algorithms for geometric optimization problems},
booktitle = {Handbook of Randomized Computation},
year = {2001},
pages = {151--201},
publisher = {Kluwer Academic Publishers}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This chapter reviews randomization algorithms developed in the last few years to solve a wide range of geometric optimization problems. We rst review a number of general techniques, including randomized binary search, randomized linear-programming algorithms, and random sampling. Next, we describe several applications of these and other techniques, including facility location, proximity problems, statistical estimators, nearest neighbor searching, and Euclidean TSP.
