Result: Simple distributed algorithms for approximating minimum steiner trees

Title:
Simple distributed algorithms for approximating minimum steiner trees
Authors:
CHALERMSOOK, Parinya, FAKCHAROENPHOL, Jittat
Source:
COCOON 2005 : computing and combinatorics (Kunming, 16-29 August 2005)Lecture notes in computer science. :380-389
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 20 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Flots dans les réseaux. Problèmes combinatoires, Flows in networks. Combinatorial problems, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Recherche information. Graphe, Information retrieval. Graph, Logiciel, Software, Systèmes informatiques et systèmes répartis. Interface utilisateur, Computer systems and distributed systems. User interface, Algorithme approximation, Approximation algorithm, Algoritmo aproximación, Algorithme réparti, Distributed algorithm, Algoritmo repartido, Arbre maximal, Spanning tree, Arbol máximo, Multidestinataire, Multicast, Multidestinatario, Méthode heuristique, Heuristic method, Método heurístico, Métrique, Metric, Métrico, Plus court chemin, Shortest path, Camino más corto, Problème arbre Steiner, Steiner tree problem, Problema arbol Steiner, Problème combinatoire, Combinatorial problem, Problema combinatorio, Routage, Routing, Enrutamiento, Réseau ad hoc, Ad hoc network, Red ad hoc, Système réparti, Distributed system, Sistema repartido, Terminal, Transmission synchrone, Synchronous transmission, Transmisión sincrónica, Réseau sans fil, Wireless network, Red sin hilo
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Asian Institute of Technology, Pathumthanim, Thailand
Kasetsart University, Bangkok, Thailand
Department of Computer Engineering Kasetsart University, Bangkok, Thailand
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=17096434
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Operational research. Management
Accession Number:
edscal.17096434
Database:
PASCAL Archive

Further Information

Given a network G = (V, E), edge weights w(.), and a set of terminals S C V, the minimum-weight Steiner tree problem is to find a tree in G that spans S with minimum weight. Most provable heuristics treat the network G is a metric; This assumption, in a distributed setting, cannot be easily achieved without a subtle overhead. We give a simple distributed algorithm based on a minimum spanning tree heuristic that returns a solution whose cost is within a factor of two of the optimal. The algorithm runs in time O(|V| log |V|) on a synchronous network. We also show that another heuristic based on iteratively finding shortest paths gives a Θ(log |V|)-approximation using a novel charging scheme based on low-congestion routing on trees. Both algorithms work for unit-cost and general cost cases. The algorithms also have applications in finding multicast trees in wireless ad hoc networks.