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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 68; číslo 2; s. 337 - 357
Hlavní autoři:	Bilò, Davide, Gualà, Luciano, Proietti, Guido
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Boston Springer US 01.02.2014 Springer
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!