Spanners with Slack T.-H. Hubert Chan , Michael Dinitz , and Anupam Gupta Carnegie Mellon University Abstract. Given a metric (V, d), a spanner is a sparse graph whose shortest-path metric approximates the distance - Path graph - Document - PDFSEARCH.IO

First Page	Meta Content
	Spanners with Slack T.-H. Hubert Chan , Michael Dinitz , and Anupam Gupta Carnegie Mellon University Abstract. Given a metric (V, d), a spanner is a sparse graph whose shortest-path metric approximates the distance Add to Reading List Document Date: 2006-10-19 14:58:23 Open Document File Size: 437,20 KB Share Result on Facebook City Pittsburgh / / Facility Carnegie Mellon University / / IndustryTerm resource-location applications / approximation algorithms / / Organization Croucher Foundation / National Science Foundation / Carnegie Mellon University / Computer Science Department / / Person H. Hubert Chan / Anupam Gupta Carnegie / Michael Dinitz / / Position General / representative / / ProvinceOrState Pennsylvania / / Technology approximation algorithms / ESA / / SocialTag Metric geometry Mathematical analysis Metric space Embedding Planar graph Metric Geometric spanner Mathematics Topology Geometry

Spanners with Slack T.-H. Hubert Chan , Michael Dinitz , and Anupam Gupta Carnegie Mellon University Abstract. Given a metric (V, d), a spanner is a sparse graph whose shortest-path metric approximates the distanceAdd to Reading List