Geometric approximation algorithms /

Weitere Versionen (2)
Gespeichert in:
Weitere Titel:
1. The power of grids -- closest pair and smallest enclosing disk
2. Quadtrees -- hierarchical grids
3. Well-separated pair decomposition
4. Clustering -- definitions and basic algorithms
5. On complexity, sampling, and $\varepsilon $-nets and $\varepsilon $-samples
6. Approximation via reweighting
7. Yet even more on sampling
8. Sampling and the moments technique
9. Depth estimation via sampling
10. Approximating the depth via sampling and emptiness
11. Random partition via shifting
12. Good triangulations and meshing
13. Approximating the Euclidean traveling salesman problem (TSP)
14. Approximating the Euclidean TSP using bridges
15. Linear programming in low dimensions
16. Polyhedrons, polytopes, and linear programming
17. Approximate nearest neighbor search in low dimension
18. Approximate nearest neighbor via point-location
19. Dimension Reducation - The Johnson-Lindenstrauss (JL)lemma
20. Approximate nearest neighbor (ANN) search in high dimensions
21. Approximating a convex body by an ellipsoid
22. Approximating the minimum volume bounding box of a point set
23. Coresets
24. Approximation using shell sets
25. Duality
26. Finite metric spaces and partitions
27. Some probability and tail inequalities
28. Miscellaneous prerequisite
1. Verfasser:
Har-Peled, Sariel
Format:
Elektronisch E-Book
Sprache:
Englisch
Veröffentlicht:
Providence, R.I. : American Mathematical Society, c2011.
Umfang:
1 online resource (xii, 362 p. : ill. (some col.))
Mode of access : World Wide Web
Format Details:
Mode of access : World Wide Web
Bibliografie:
Includes bibliographical references (p. 349-356) and index.
Sekundärform:
Publikations­art: Electronic reproduction.
Verlag: Providence, Rhode Island :: American Mathematical Society.
Publikations­datum: 2012
ISBN:
9781470414009 (online)
ISSN:
2331-7159 ;
0076-5376
DOI:
http://dx.doi.org/10.1090/surv/173
Zugangseinschränkungen:
Access is restricted to licensed institutions
Schlagworte:
Approximation algorithms.
Geometry > Data processing.
Computer graphics.
Discrete geometry.
Computer science > Computing methodologies and applications > Computer graphics; computational geometry.
Computer science > Algorithms > Approximation algorithms.
Computer science > Theory of data > Data structures.
Convex and discrete geometry > Discrete geometry > Discrete geometry.
Bezugswerke:
Links: