Sökning: onr:"swepub:oai:lup.lub.lu.se:9057d95e-64b8-4fb9-88c9-75809aadded9" >
Max-stretch reducti...
Max-stretch reduction for tree spanners
- Artikel/kapitelEngelska2005
Förlag, utgivningsår, omfång ...
-
Berlin, Heidelberg :Springer Berlin Heidelberg,2005
Nummerbeteckningar
-
LIBRIS-ID:oai:lup.lub.lu.se:9057d95e-64b8-4fb9-88c9-75809aadded9
-
https://lup.lub.lu.se/record/220496URI
-
https://doi.org/10.1007/11534273DOI
Kompletterande språkuppgifter
-
Språk:engelska
-
Sammanfattning på:engelska
Ingår i deldatabas
Klassifikation
-
Ämneskategori:kon swepub-publicationtype
-
Ämneskategori:ref swepub-contenttype
Anmärkningar
-
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.
Ämnesord och genrebeteckningar
Biuppslag (personer, institutioner, konferenser, titlar ...)
-
Lingas, AndrzejLund University,Lunds universitet,Data Vetenskap,Naturvetenskapliga fakulteten,Computer Science,Faculty of Science(Swepub:lu)cs-ali
(författare)
-
Okita, M
(författare)
-
Data VetenskapNaturvetenskapliga fakulteten
(creator_code:org_t)
Sammanhörande titlar
-
Ingår i:Algorithms and Data Structures / Lecture Notes in Computer ScienceBerlin, Heidelberg : Springer Berlin Heidelberg3608, s. 122-1330302-97431611-33499783540281016
Internetlänk
Hitta via bibliotek
Till lärosätets databas