Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs

Yuval Emek, David Peleg

Research output: Contribution to conferencePaperpeer-review

27 Scopus citations

Abstract

Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The problem of finding a tree t-spanner minimizing t is referred to as the Minimum Max-Stretch spanning Tree (MMST) problem. This paper concerns the MMST problem on unweighted graphs. The problem is known to be NP-hard, and the paper presents an O(log n) approximation algorithm for it.

Original languageEnglish
Pages254-263
Number of pages10
StatePublished - 2004
Externally publishedYes
EventProceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms - New Orleans, LA., United States
Duration: 11 Jan 200413 Jan 2004

Conference

ConferenceProceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms
Country/TerritoryUnited States
CityNew Orleans, LA.
Period11/01/0413/01/04

Fingerprint

Dive into the research topics of 'Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs'. Together they form a unique fingerprint.

Cite this