Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs

Yuval Emek; David Peleg

Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs

Data and Decision Sciences

Research output: Contribution to conference › Paper › peer-review

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 language	English
Pages	254-263
Number of pages	10
State	Published - 2005
Event	Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms - New Orleans, LA., United States Duration: 11 Jan 2004 → 13 Jan 2004

Conference

Conference	Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms
Country/Territory	United States
City	New Orleans, LA.
Period	11/01/04 → 13/01/04

ASJC Scopus subject areas

Software
General Mathematics

Cite this

@conference{ac3ad6f70a90496a93abf2a8570ea3d7,

title = "Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs",

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.",

author = "Yuval Emek and David Peleg",

year = "2005",

language = "אנגלית",

pages = "254--263",

note = "Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms ; Conference date: 11-01-2004 Through 13-01-2004",

}

TY - CONF

T1 - Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs

AU - Emek, Yuval

AU - Peleg, David

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=1842488231&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:1842488231

SP - 254

EP - 263

T2 - Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms

Y2 - 11 January 2004 through 13 January 2004

ER -

Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this