Finite metric spaces--combinatorics, geometry and algorithms
| dc.creator | Linial, Nathan | |
| dc.date | 2003-04-28 | |
| dc.date.accessioned | 2026-07-07T04:57:33Z | |
| dc.date.available | 2026-07-07T04:57:33Z | |
| dc.description | Finite metric spaces arise in many different contexts. Enormous bodies of data, scientific, commercial and others can often be viewed as large metric spaces. It turns out that the metric of graphs reveals a lot of interesting information. Metric spaces also come up in many recent advances in the theory of algorithms. Finally, finite submetrics of classical geometric objects such as normed spaces or manifolds reflect many important properties of the underlying structure. In this paper we review some of the recent advances in this area. | |
| dc.identifier | https://arxiv.org/abs/math/0304466 | |
| dc.identifier | http://arxiv.org/abs/math/0304466 | |
| dc.identifier | Proceedings of the ICM, Beijing 2002, vol. 3, 573--586 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/67298 | |
| dc.subject | Combinatorics | |
| dc.subject | Combinatorics, Algorithms, Geometry | |
| dc.title | Finite metric spaces--combinatorics, geometry and algorithms | |
| dc.type | text |