Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree

Given an n -node, undirected and 2-edge-connected graph G =( V , E ) with positive real weights on its m edges, given a set of k source nodes S ⊆ V , and given a spanning tree T of G , the routing cost from S of T is the sum of the distances in T from every source s ∈ S to all the other nodes of G ....

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 68; no. 2; pp. 337 - 357
Main Authors:	Bilò, Davide, Gualà, Luciano, Proietti, Guido
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.02.2014 Springer
Subjects:	Access methods and protocols, osi model Algorithm Analysis and Problem Complexity Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer Science Computer science; control theory; systems Computer Systems Organization and Communication Networks Data Structures and Information Theory Exact sciences and technology Information retrieval. Graph Mathematics of Computing Telecommunications Telecommunications and information theory Teleprocessing networks. Isdn Theoretical computing Theory of Computation All-best swap edges problems Transient edge failures Graph algorithms Minimum routing-cost spanning tree Transient response Edge(graph) Connected graph Routing Linear time Replacement Graph theory Modeling Fault tolerance Graph connectivity Spanning tree Center of mass Subgraph
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	Given an n -node, undirected and 2-edge-connected graph G =( V , E ) with positive real weights on its m edges, given a set of k source nodes S ⊆ V , and given a spanning tree T of G , the routing cost from S of T is the sum of the distances in T from every source s ∈ S to all the other nodes of G . If an edge e of T undergoes a transient failure, and one needs to promptly reestablish the connectivity, then to reduce set-up and rerouting costs it makes sense to temporarily replace e by means of a swap edge , i.e., an edge in G reconnecting the two subtrees of T induced by the removal of e . Then, a best swap edge for e is a swap edge which minimizes the routing cost from S of the tree obtained after the swapping. As a natural extension, the all-best swap edges problem is that of finding a best swap edge for every edge of T , and this has been recently solved in O ( mn ) time and linear space. In this paper, we focus our attention on the relevant cases in which k = O (1) and k = n , which model realistic communication paradigms. For these cases, we improve the above result by presenting an time and linear space algorithm. Moreover, for the case k = n , we also provide an accurate analysis showing that the obtained swap tree is effective in terms of routing cost. Indeed, if the input tree T has a routing cost from V which is a constant-factor away from that of a minimum routing-cost spanning tree (whose computation is a problem known to be in APX), and if in addition nodes in T enjoys a suitable distance stretching property from a tree centroid (which can be constructively induced, as we show), then the tree obtained after the swapping has a routing cost from V which is still a constant-ratio approximation of that of a new (i.e., in the graph deprived of the failed edge) minimum routing-cost spanning tree.
AbstractList	Given an n -node, undirected and 2-edge-connected graph G =( V , E ) with positive real weights on its m edges, given a set of k source nodes S ⊆ V , and given a spanning tree T of G , the routing cost from S of T is the sum of the distances in T from every source s ∈ S to all the other nodes of G . If an edge e of T undergoes a transient failure, and one needs to promptly reestablish the connectivity, then to reduce set-up and rerouting costs it makes sense to temporarily replace e by means of a swap edge , i.e., an edge in G reconnecting the two subtrees of T induced by the removal of e . Then, a best swap edge for e is a swap edge which minimizes the routing cost from S of the tree obtained after the swapping. As a natural extension, the all-best swap edges problem is that of finding a best swap edge for every edge of T , and this has been recently solved in O ( mn ) time and linear space. In this paper, we focus our attention on the relevant cases in which k = O (1) and k = n , which model realistic communication paradigms. For these cases, we improve the above result by presenting an time and linear space algorithm. Moreover, for the case k = n , we also provide an accurate analysis showing that the obtained swap tree is effective in terms of routing cost. Indeed, if the input tree T has a routing cost from V which is a constant-factor away from that of a minimum routing-cost spanning tree (whose computation is a problem known to be in APX), and if in addition nodes in T enjoys a suitable distance stretching property from a tree centroid (which can be constructively induced, as we show), then the tree obtained after the swapping has a routing cost from V which is still a constant-ratio approximation of that of a new (i.e., in the graph deprived of the failed edge) minimum routing-cost spanning tree.
Author	Gualà, Luciano Bilò, Davide Proietti, Guido
Author_xml	– sequence: 1 givenname: Davide surname: Bilò fullname: Bilò, Davide organization: Dipartimento di Informatica, Università di L’Aquila – sequence: 2 givenname: Luciano surname: Gualà fullname: Gualà, Luciano organization: Dipartimento di Matematica, Università di Tor Vergata – sequence: 3 givenname: Guido surname: Proietti fullname: Proietti, Guido email: guido.proietti@univaq.it organization: Dipartimento di Informatica, Università di L’Aquila, Istituto di Analisi dei Sistemi ed Informatica, CNR
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=28568814$$DView record in Pascal Francis
BookMark	eNp9kLFOwzAQhi1UJNrCA7BlYTScYzt2RqhaQCpComW2nNgprlqnslOh8vQ4CiwMTHe6-7-T7pugkW-9ReiawC0BEHcRgHGKgeS4LATDpzM0JozmGDgjIzQGIiRmBREXaBLjFlJQlMUYLRbOG-c32YONXbb61IdsbjY2Zi_Ou7376lfdh83e2mPX97M2xdom09nqoL3vR-tg7SU6b_Qu2qufOkXvi_l69oSXr4_Ps_slrimRHdZSGGmFpZoCkU1VcsFkRSCvGOFFCbmpdJnWthK8ZAYkcGkYyzktjbWG0im6Ge4edKz1rgna1y6qQ3B7HU4ql7yQMv09RWLI1aGNMdhG1a7TnWt9F7TbKQKq16YGbSrZUL02dUok-UP-Hv-PyQcmpqzf2KC27TH4JOIf6BuSfYB7
CitedBy_id	crossref_primary_10_1016_j_tcs_2018_11_008 crossref_primary_10_1007_s00453_014_9912_6 crossref_primary_10_1007_s10878_016_0026_8 crossref_primary_10_3390_math11071678 crossref_primary_10_1016_j_ipl_2020_105979 crossref_primary_10_1007_s00453_019_00549_w
Cites_doi	10.1016/S0166-218X(99)00212-7 10.1007/s00453-002-0988-z 10.1007/s00453-007-9080-z 10.1007/BF01459088 10.1137/S009753979732253X 10.1137/0601008 10.1016/j.tcs.2007.03.046 10.1137/0213024 10.1002/net.3230080402 10.1016/0020-0190(82)90137-5 10.1007/BF01187017 10.1016/0020-0190(89)90136-1 10.7155/jgaa.00039 10.1007/978-3-540-75142-7_22 10.1007/978-3-540-92182-0_63 10.1007/978-3-540-87744-8_38 10.1093/ietisy/e89-d.2.700 10.1007/11602613_96 10.1007/3-540-45995-2_44 10.1007/978-3-642-10877-8_29
ContentType	Journal Article
Copyright	Springer Science+Business Media, LLC 2012 2015 INIST-CNRS
Copyright_xml	– notice: Springer Science+Business Media, LLC 2012 – notice: 2015 INIST-CNRS
DBID	AAYXX CITATION IQODW
DOI	10.1007/s00453-012-9674-y
DatabaseName	CrossRef Pascal-Francis
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science Applied Sciences
EISSN	1432-0541
EndPage	357
ExternalDocumentID	28568814 10_1007_s00453_012_9674_y
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C -~X .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 203 23M 28- 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDPE ABDZT ABECU ABFSI ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTAH ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AI. AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BBWZM BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP E.L EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAS LLZTM M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P9O PF- PT4 PT5 QOK QOS R4E R89 R9I RHV RIG RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TN5 TSG TSK TSV TUC U2A UG4 UOJIU UQL UTJUX UZXMN VC2 VFIZW VH1 VXZ W23 W48 WK8 YLTOR Z45 Z7X Z83 Z88 Z8R Z8W Z92 ZMTXR ZY4 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION IQODW
ID	FETCH-LOGICAL-c318t-a87d8e7e3a3018fb95748b102b4156902dba97e3eb7594d08058d442539deed33
IEDL.DBID	RSV
ISICitedReferencesCount	7
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000330032200003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0178-4617
IngestDate	Wed Apr 02 07:46:49 EDT 2025 Sat Nov 29 03:45:25 EST 2025 Tue Nov 18 20:56:21 EST 2025 Fri Feb 21 02:40:21 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	2
Keywords	All-best swap edges problems Transient edge failures Graph algorithms Minimum routing-cost spanning tree Transient response Edge(graph) Connected graph Routing Linear time Replacement Graph theory Modeling Fault tolerance Graph connectivity Spanning tree Center of mass Subgraph
Language	English
License	http://www.springer.com/tdm CC BY 4.0
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c318t-a87d8e7e3a3018fb95748b102b4156902dba97e3eb7594d08058d442539deed33
PageCount	21
ParticipantIDs	pascalfrancis_primary_28568814 crossref_citationtrail_10_1007_s00453_012_9674_y crossref_primary_10_1007_s00453_012_9674_y springer_journals_10_1007_s00453_012_9674_y
PublicationCentury	2000
PublicationDate	2014-02-01
PublicationDateYYYYMMDD	2014-02-01
PublicationDate_xml	– month: 02 year: 2014 text: 2014-02-01 day: 01
PublicationDecade	2010
PublicationPlace	Boston
PublicationPlace_xml	– name: Boston – name: Heidelberg
PublicationTitle	Algorithmica
PublicationTitleAbbrev	Algorithmica
PublicationYear	2014
Publisher	Springer US Springer
Publisher_xml	– name: Springer US – name: Springer
References	Hershberger (CR10) 1989; 33 Wu, Lancia, Bafna, Chao, Ravi, Tang (CR19) 1999; 29 Di Salvo, Proietti (CR5) 2007; 383 Booth, Westbrook (CR3) 1994; 11 Harel, Tarjan (CR9) 1984; 13 Ackermann (CR1) 1928; 99 Nardelli, Proietti, Widmayer (CR12) 2001; 5 Pettie, Deng, Du (CR16) 2005 Bender, Farach-Colton, Rajsbaum (CR2) 2002 Das, Gfeller, Widmayer, Hong, Nagamochi, Fukunaga (CR4) 2008 Tarjan (CR17) 1982; 14 Flocchini, Enriques, Pagli, Prencipe, Santoro (CR6) 2006; 89-D Gfeller, Santoro, Widmayer, Pelc (CR7) 2007 Gfeller, Halperin, Mehlhorn (CR8) 2008 Wu, Hsiao, Chao (CR21) 2008; 50 Johnson, Lenstra, Kan (CR11) 1978; 8 Wu, Chao, Tang (CR20) 2000; 102 Pagli, Prencipe, Abdelzaher, Raynal, Santoro (CR15) 2009 Nivasch (CR14) 2010; 57 Wong (CR18) 1980; 1 Nardelli, Proietti, Widmayer (CR13) 2003; 35 B.Y. Wu (9674_CR19) 1999; 29 S. Pettie (9674_CR16) 2005 S. Das (9674_CR4) 2008 A. Di Salvo (9674_CR5) 2007; 383 R. Wong (9674_CR18) 1980; 1 E. Nardelli (9674_CR12) 2001; 5 W. Ackermann (9674_CR1) 1928; 99 H. Booth (9674_CR3) 1994; 11 B. Gfeller (9674_CR8) 2008 M.A. Bender (9674_CR2) 2002 E. Nardelli (9674_CR13) 2003; 35 R.E. Tarjan (9674_CR17) 1982; 14 D. Harel (9674_CR9) 1984; 13 B. Gfeller (9674_CR7) 2007 G. Nivasch (9674_CR14) 2010; 57 B.Y. Wu (9674_CR21) 2008; 50 B.Y. Wu (9674_CR20) 2000; 102 P. Flocchini (9674_CR6) 2006; 89-D L. Pagli (9674_CR15) 2009 D. Johnson (9674_CR11) 1978; 8 J. Hershberger (9674_CR10) 1989; 33
References_xml	– start-page: 508 year: 2002 end-page: 515 ident: CR2 article-title: The level ancestor problem simplified publication-title: Theoretical Informatics, 5th Latin American Symposium (LATIN) – volume: 102 start-page: 245 issue: 3 year: 2000 end-page: 266 ident: CR20 article-title: Approximation algorithms for some optimum communication spanning tree problems publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(99)00212-7 – volume: 35 start-page: 56 issue: 1 year: 2003 end-page: 74 ident: CR13 article-title: Swapping a failing edge of a single source shortest paths tree is good and fast publication-title: Algorithmica doi: 10.1007/s00453-002-0988-z – volume: 50 start-page: 299 issue: 3 year: 2008 end-page: 311 ident: CR21 article-title: The swap edges of a multiple-sources routing tree publication-title: Algorithmica doi: 10.1007/s00453-007-9080-z – volume: 99 start-page: 118 year: 1928 end-page: 133 ident: CR1 article-title: Zum hilbertschen Aufbau der reellen Zahlen publication-title: Math. Ann. doi: 10.1007/BF01459088 – volume: 29 start-page: 761 issue: 3 year: 1999 end-page: 778 ident: CR19 article-title: A polynomial-time approximation scheme for minimum routing cost spanning trees publication-title: SIAM J. Comput. doi: 10.1137/S009753979732253X – volume: 1 start-page: 51 year: 1980 end-page: 63 ident: CR18 article-title: Worst-case analysis of network design problem heuristics publication-title: SIAM J. Algebr. Discrete Methods doi: 10.1137/0601008 – volume: 383 start-page: 23 issue: 1 year: 2007 end-page: 33 ident: CR5 article-title: Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2007.03.046 – volume: 13 start-page: 338 issue: 2 year: 1984 end-page: 355 ident: CR9 article-title: Fast algorithms for finding nearest common ancestors publication-title: SIAM J. Comput. doi: 10.1137/0213024 – start-page: 716 year: 2008 end-page: 727 ident: CR4 article-title: Computing best swaps in optimal tree spanners publication-title: 19th Int. Symposium on Algorithms and Computation (ISAAC) – volume: 8 start-page: 279 issue: 4 year: 1978 end-page: 285 ident: CR11 article-title: The complexity of the network design problem publication-title: Networks doi: 10.1002/net.3230080402 – volume: 57 start-page: 1 issue: 3 year: 2010 end-page: 44 ident: CR14 article-title: Improved bounds and new techniques for Davenport–Schinzel sequences and their generalizations publication-title: J. ACM – volume: 89-D start-page: 700 issue: 2 year: 2006 end-page: 708 ident: CR6 article-title: Point-of-failure shortest-path rerouting: computing the optimal swap edges distributively publication-title: IEICE Trans. – volume: 14 start-page: 30 issue: 1 year: 1982 end-page: 33 ident: CR17 article-title: Sensitivity analysis of minimum spanning trees and shortest path trees publication-title: Inf. Process. Lett. doi: 10.1016/0020-0190(82)90137-5 – volume: 11 start-page: 341 issue: 4 year: 1994 end-page: 352 ident: CR3 article-title: A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs publication-title: Algorithmica doi: 10.1007/BF01187017 – start-page: 365 year: 2009 end-page: 371 ident: CR15 article-title: Brief announcement: distributed swap edges computation for minimum routing cost spanning trees publication-title: Principles of Distributed Systems, 13th International Conference (OPODIS) – start-page: 964 year: 2005 end-page: 973 ident: CR16 article-title: Sensitivity analysis of minimum spanning trees in sub-inverse-Ackermann time publication-title: 16th Int. Symposium on Algorithms and Computation (ISAAC) – volume: 33 start-page: 169 issue: 4 year: 1989 end-page: 174 ident: CR10 article-title: Finding the upper envelope of line segments in ( log ) time publication-title: Inf. Process. Lett. doi: 10.1016/0020-0190(89)90136-1 – volume: 5 start-page: 39 issue: 5 year: 2001 end-page: 57 ident: CR12 article-title: Finding all the best swaps of a minimum diameter spanning tree under transient edge failures publication-title: J. Graph Algorithms Appl. doi: 10.7155/jgaa.00039 – start-page: 268 year: 2007 end-page: 282 ident: CR7 article-title: A distributed algorithm for finding all best swap edges of a minimum diameter spanning tree publication-title: 21st Int. Symposium on Distributed Computing (DISC) – start-page: 454 year: 2008 end-page: 465 ident: CR8 article-title: Faster swap edge computation in minimum diameter spanning trees publication-title: 16th Annual European Symposium on Algorithms (ESA) – start-page: 268 volume-title: 21st Int. Symposium on Distributed Computing (DISC) year: 2007 ident: 9674_CR7 doi: 10.1007/978-3-540-75142-7_22 – start-page: 716 volume-title: 19th Int. Symposium on Algorithms and Computation (ISAAC) year: 2008 ident: 9674_CR4 doi: 10.1007/978-3-540-92182-0_63 – start-page: 454 volume-title: 16th Annual European Symposium on Algorithms (ESA) year: 2008 ident: 9674_CR8 doi: 10.1007/978-3-540-87744-8_38 – volume: 8 start-page: 279 issue: 4 year: 1978 ident: 9674_CR11 publication-title: Networks doi: 10.1002/net.3230080402 – volume: 5 start-page: 39 issue: 5 year: 2001 ident: 9674_CR12 publication-title: J. Graph Algorithms Appl. doi: 10.7155/jgaa.00039 – volume: 1 start-page: 51 year: 1980 ident: 9674_CR18 publication-title: SIAM J. Algebr. Discrete Methods doi: 10.1137/0601008 – volume: 89-D start-page: 700 issue: 2 year: 2006 ident: 9674_CR6 publication-title: IEICE Trans. doi: 10.1093/ietisy/e89-d.2.700 – start-page: 964 volume-title: 16th Int. Symposium on Algorithms and Computation (ISAAC) year: 2005 ident: 9674_CR16 doi: 10.1007/11602613_96 – volume: 383 start-page: 23 issue: 1 year: 2007 ident: 9674_CR5 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2007.03.046 – volume: 29 start-page: 761 issue: 3 year: 1999 ident: 9674_CR19 publication-title: SIAM J. Comput. doi: 10.1137/S009753979732253X – volume: 35 start-page: 56 issue: 1 year: 2003 ident: 9674_CR13 publication-title: Algorithmica doi: 10.1007/s00453-002-0988-z – start-page: 508 volume-title: Theoretical Informatics, 5th Latin American Symposium (LATIN) year: 2002 ident: 9674_CR2 doi: 10.1007/3-540-45995-2_44 – volume: 14 start-page: 30 issue: 1 year: 1982 ident: 9674_CR17 publication-title: Inf. Process. Lett. doi: 10.1016/0020-0190(82)90137-5 – volume: 11 start-page: 341 issue: 4 year: 1994 ident: 9674_CR3 publication-title: Algorithmica doi: 10.1007/BF01187017 – volume: 50 start-page: 299 issue: 3 year: 2008 ident: 9674_CR21 publication-title: Algorithmica doi: 10.1007/s00453-007-9080-z – volume: 99 start-page: 118 year: 1928 ident: 9674_CR1 publication-title: Math. Ann. doi: 10.1007/BF01459088 – volume: 33 start-page: 169 issue: 4 year: 1989 ident: 9674_CR10 publication-title: Inf. Process. Lett. doi: 10.1016/0020-0190(89)90136-1 – volume: 102 start-page: 245 issue: 3 year: 2000 ident: 9674_CR20 publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(99)00212-7 – volume: 57 start-page: 1 issue: 3 year: 2010 ident: 9674_CR14 publication-title: J. ACM – start-page: 365 volume-title: Principles of Distributed Systems, 13th International Conference (OPODIS) year: 2009 ident: 9674_CR15 doi: 10.1007/978-3-642-10877-8_29 – volume: 13 start-page: 338 issue: 2 year: 1984 ident: 9674_CR9 publication-title: SIAM J. Comput. doi: 10.1137/0213024
SSID	ssj0012796
Score	2.0864718
Snippet	Given an n -node, undirected and 2-edge-connected graph G =( V , E ) with positive real weights on its m edges, given a set of k source nodes S ⊆ V , and given...
SourceID	pascalfrancis crossref springer
SourceType	Index Database Enrichment Source Publisher
StartPage	337
SubjectTerms	Access methods and protocols, osi model Algorithm Analysis and Problem Complexity Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer Science Computer science; control theory; systems Computer Systems Organization and Communication Networks Data Structures and Information Theory Exact sciences and technology Information retrieval. Graph Mathematics of Computing Telecommunications Telecommunications and information theory Teleprocessing networks. Isdn Theoretical computing Theory of Computation
Title	Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree
URI	https://link.springer.com/article/10.1007/s00453-012-9674-y
Volume	68
WOSCitedRecordID	wos000330032200003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1432-0541 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012796 issn: 0178-4617 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEA66ehDE9YnrY8nBkxJo07RJj7pYPOgi7ip7K2mbQEG7Zbsq66930hcsPkBvhUxCmcl0vjKPD6EzraitfM8m0nG0GartEkkZGMR1JNfakkyXjcK3fDgUk4l_X_dxF021e5OSLL_UbbObQR-m9ocS3-OMLFbRGkQ7YfgaHkZPbeqA8pKUy9DOEwbxuUllfnfEUjDazGUBetEVocWXzGgZcILuv151G23V-BJfVhdiB62obBd1G-4GXLvyHgqCtOxnwVcQFvDoXeb42sx7wHdplr6kH2YJsCE2FUPmeTAFsanGEo_yiuYIj2dK7aPH4Ho8uCE1pwKJwXvnRAqeCMWVI8GzhY58lzMRAcqIzJ-cb9Ekkj4sq4i7PksAT7oiYeDYjp9AOHWcA9TJppk6RDi2NE0UmJMLjyW2lvCzSJXHVMJAlNMeshrlhnE9cNzwXjyH7ajkUk8h6Ck0egoXPXTebsmraRu_CfeXLNbuoML1hLBZD1005glrzyx-Pu7oT9LHaAOgE6vqt09QZz57VadoPX6bp8WsX97IT9nV2o8
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1ZS8NAEB60CgpiPbEedR98UgLNZpPdPGppqdgWsVX6FjbNLgS0LW1V6q93NhcUD9C3wM4uYWYn84U5PoALraitfM-2pONoM1TbtSRlaBDXkVzrmmQ6aRRu825XDAb-fdbHPcur3fOUZPKlLprdDPowtT_U8j3OrMUqrDEMWGZg_kPvqUgdUJ6QchnaeYthfM5Tmd8dsRSMtiZyhnrRKaHFl8xoEnCa5X-96g5sZ_iSXKcXYhdW1GgPyjl3A8lceR-azTjpZyE3GBZI711OSMPMeyCdeBS_xB9mCbEhMRVD5rk-RrGxJpL0JinNEelPlTqAx2ajX29ZGaeCNUTvnVtS8EgorhyJni106LuciRBRRmj-5PwajULp47IKueuzCPGkKyKGju34EYZTxzmE0mg8UkdAhjVNI4Xm5MJjka0l_ixS5TEVMRTltAK1XLnBMBs4bngvnoNiVHKipwD1FBg9BYsKXBZbJum0jd-Eq0sWK3ZQ4XpC2KwCV7l5gswzZz8fd_wn6XPYaPU77aB92707gU2EUSyt5T6F0nz6qs5gffg2j2fTanI7PwEhv91z
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1ZS8QwEB50FRHEW1yPNQ8-KcXdNG3SR6-iqIuwKr6VdJNAQbtld1X01zvpBYsHiG-FTEKZyTATZub7APaNph0d-B1Huq6xoNqeIylDg3iu5Ma0JTP5oPA173bF42NwW_Kcjqpu96okWcw0WJSmdHyUKXNUD77ZTMT2AVEn8Dlz3qdhhtk-evtc7z3UZQTKc4IuS0HvMIzVVVnzuyMmAtNCJkeoI1OQW3ypkubBJ1z6928vw2KZd5Lj4qKswJROV2Gp4nQgpYuvQRgm-ZwLOcFwQXpvMiPnFgeC3CRp8px82CXMGYntJLLfpwMUGxgiSS8r6I_I3VDrdbgPz-9OL5ySa8Hpo1ePHSm4EpprV6LHCxMHHmcixuwjti-8oE1VLANc1jH3AqYwz_SEYujwbqAwzLruBjTSQao3gfTbhiqNZubCZ6pjJD4iqfaZVgxFOW1Cu1J01C-ByC0fxlNUQyjneopQT5HVU_TehIN6S1agcPwm3JqwXr2DCs8XosOacFiZKio9dvTzcVt_kt6DuduzMLq-7F5twzxmV6xo8d6Bxnj4ondhtv86TkbDVn5RPwE8euZX
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Finding+Best+Swap+Edges+Minimizing+the+Routing+Cost+of+a+Spanning+Tree&rft.jtitle=Algorithmica&rft.au=Bil%C3%B2%2C+Davide&rft.au=Gual%C3%A0%2C+Luciano&rft.au=Proietti%2C+Guido&rft.date=2014-02-01&rft.pub=Springer+US&rft.issn=0178-4617&rft.eissn=1432-0541&rft.volume=68&rft.issue=2&rft.spage=337&rft.epage=357&rft_id=info:doi/10.1007%2Fs00453-012-9674-y&rft.externalDocID=10_1007_s00453_012_9674_y
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0178-4617&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0178-4617&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0178-4617&client=summon