onr:"swepub:oai:lup.lub.lu.se:9057d95e-64b8-4fb9-88c9-75809aadded9"
Search: onr:"swepub:oai:lup.lub.lu.se:9057d95e-64b8-4fb9-88c9-75809aadded9" > Max-stretch reducti...
- 1 of 1
- Previous record
- Next record
- To hitlist
Max-stretch reduction for tree spanners
- Iwama, K (author)
-
- Lingas, Andrzej (author)
- Lund University,Lunds universitet,Data Vetenskap,Naturvetenskapliga fakulteten,Computer Science,Faculty of Science
- Okita, M (author)
- (creator_code:org_t)
- Berlin, Heidelberg : Springer Berlin Heidelberg, 2005
- 2005
- English.
- In: Algorithms and Data Structures / Lecture Notes in Computer Science. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 0302-9743 .- 1611-3349. - 9783540281016 ; 3608, s. 122-133
- Conference paper (peer-reviewed)
Abstract
Subject headings
Close
- A tree t-spanner T of a graph G is a spanning tree of G whose max-stretch is t, i.e., the distance between any two vertices in T is at most t times their distance in G. If G has a tree t-spanner but not a tree (t - 1)-spanner, then G is said to have max-stretch of t. In this paper, we study the Max-Stretch Reduction Problem: for an unweighted graph G = (V, E), find a set of edges not in E originally whose insertion into G can decrease the max-stretch of G. Our results are as follows: (i) For a ring graph, we give a linear-time algorithm which inserts k edges improving the max-stretch optimally. (ii) For a grid graph, we give a nearly optimal max-stretch reduction algorithm which preserves the structure of the grid. (iii) In the general case, we show that it is NP-hard to decide, for a given graph G and its spanning tree of max-stretch t, whether or not one-edge insertion can decrease the max-stretch to t- 1. (iv) Finally, we show that the max-stretch of an arbitrary graph on n vertices can be reduced to s' >= 2 by inserting O(n/s') edges, which can be determined in linear time, and observe that this number of edges is optimal up to a constant.
Subject headings
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Publication and Content Type
- kon (subject category)
- ref (subject category)
Find in a library
- Algorithms and Data Structures / Lecture Notes in Computer Science (Search for host publication in LIBRIS)
To the university's database
- 1 of 1
- Previous record
- Next record
- To hitlist
Find more in SwePub
- By the author/editor
- Iwama, K
- Lingas, Andrzej
- Okita, M
- About the subject
-
- NATURAL SCIENCES
- NATURAL SCIENCES
- and Computer and Inf ...
- and Computer Science ...
- Articles in the publication
- Algorithms and D ...
- By the university
- Lund University
Search outside SwePub
- Extend your search to:
- Google Book Search
- Google Scholar
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
- Copyright © LIBRIS - National Library Systems
- LIBRIS.kb.se
