| 000 -LEADER |
|---|
| fixed length control field |
02692nam a2200217Ia 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
OSt |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20241203113222.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
180205s9999 xx 000 0 und d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
978-0-8218-4911-8 |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
ICTS-TIFR |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA448.D38 |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Sariel Har-Peled |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
Geometric approximation algorithms |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Name of publisher, distributor, etc. |
American Mathematical Society, |
| Date of publication, distribution, etc. |
[c2011] |
| Place of publication, distribution, etc. |
Rhode Island: |
| 300 ## - Physical Description |
|---|
| Pages: |
362 p. |
| 490 ## - SERIES STATEMENT |
|---|
| Series statement |
Mathematical Surveys and Monographs |
| Volume/sequential designation |
Vol. 173 |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
1. The power of grids—closest pair and smallest enclosing disk<br/>2. Quadtrees—hierarchical grids<br/>3. Well-separated pair decomposition<br/>4. Clustering—definitions and basic algorithms<br/>5. On complexity, sampling, and ε-nets and ε-samples<br/>6. Approximation via reweighting<br/>7. Yet even more on sampling<br/>8. Sampling and the moments technique<br/>9. Depth estimation via sampling<br/>10. Approximating the depth via sampling and emptiness<br/>11. Random partition via shifting<br/>12. Good triangulations and meshing<br/>13. Approximating the Euclidean traveling salesman problem (TSP)<br/>14. Approximating the Euclidean TSP using bridges<br/>15. Linear programming in low dimensions<br/>16. Polyhedrons, polytopes, and linear programming<br/>17. Approximate nearest neighbor search in low dimension<br/>18. Approximate nearest neighbor via point-location<br/>19. Dimension Reducation - The Johnson-Lindenstrauss (JL)lemma<br/>20. Approximate nearest neighbor (ANN) search in high dimensions<br/>21. Approximating a convex body by an ellipsoid<br/>22. Approximating the minimum volume bounding box of a point set<br/>23. Coresets<br/>24. Approximation using shell sets<br/>25. Duality<br/>26. Finite metric spaces and partitions<br/>27. Some probability and tail inequalities<br/>28. Miscellaneous prerequisite<br/> |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
Exact algorithms for dealing with geometric objects are complicated, hard to implement in practice, and slow. Over the last 20 years a theory of geometric approximation algorithms has emerged. These algorithms tend to be simple, fast, and more robust than their exact counterparts.<br/><br/>This book is the first to cover geometric approximation algorithms in detail. In addition, more traditional computational geometry techniques that are widely used in developing such algorithms, like sampling, linear programming, etc., are also surveyed. Other topics covered include approximate nearest-neighbor search, shape approximation, coresets, dimension reduction, and embeddings. The topics covered are relatively independent and are supplemented by exercises. Close to 200 color figures are included in the text to illustrate proofs and ideas. --- summary provided by publisher |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Mathematics |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Koha item type |
Book |
