Spanners with Slack

  • T. -H. Hubert Chan
  • Michael Dinitz
  • Anupam Gupta
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4168)

Abstract

Given a metric (V,d), a spanner is a sparse graph whose shortest-path metric approximates the distance d to within a small multiplicative distortion. In this paper, we study the problem of spanners with slack: e.g., can we find sparse spanners where we are allowed to incur an arbitrarily large distortion on a small constant fraction of the distances, but are then required to incur only a constant (independent of n) distortion on the remaining distances? We answer this question in the affirmative, thus complementing similar recent results on embeddings with slack into ℓp spaces. For instance, we show that if we ignore an ε fraction of the distances, we can get spanners with O(n) edges and \(O(\log {\frac{1}{\epsilon}})\) distortion for the remaining distances.

We also show how to obtain sparse and low-weight spanners with slack from existing constructions of conventional spanners, and these techniques allow us to also obtain the best known results for distance oracles and distance labelings with slack. This paper complements similar results obtained in recent research on slack embeddings into normed metric spaces.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • T. -H. Hubert Chan
    • 1
  • Michael Dinitz
    • 1
  • Anupam Gupta
    • 1
  1. 1.Carnegie Mellon University 

Personalised recommendations