English

Parallelized approximation algorithms for minimum routing cost spanning trees

Data Structures and Algorithms 2007-07-04 v2 Computational Complexity
Authors: Ching-Lueh Chang , Yuh-Dauh Lyuu
View on arXiv ↗ PDF ↗

Abstract

We parallelize several previously proposed algorithms for the minimum routing cost spanning tree problem and some related problems.

Keywords

decision tree parallel algorithm graph algorithms

Cite

@article{arxiv.0705.2125,
  title  = {Parallelized approximation algorithms for minimum routing cost spanning trees},
  author = {Ching-Lueh Chang and Yuh-Dauh Lyuu},
  journal= {arXiv preprint arXiv:0705.2125},
  year   = {2007}
}

Related papers

View all related →
Distributed, Parallel, and Cluster Computing · Computer Science
Distributed Approximation of Minimum Routing Cost Trees
Alexandra Hochuli, Stephan Holzer, Roger Wattenhofer
2014-06-06
Data Structures and Algorithms · Computer Science
Balancing Minimum Spanning and Shortest Path Trees
Samir Khuller, Balaji Raghavachari, Neal E. Young
2015-06-02
Distributed, Parallel, and Cluster Computing · Computer Science
A Distributed Parallel Algorithm for Minimum Spanning Tree Problem
Artem Mazeev, Alexander Semenov, Alexey Simonov
2016-10-18
Optimization and Control · Mathematics
A parallel framework for graphical optimal transport
Jiaojiao Fan, Isabel Haasler, Qinsheng Zhang, Johan Karlsson +1
2025-12-02
Computational Complexity · Computer Science
On the approximability of robust spanning tree problems
Adam Kasperski, Pawel Zielinski
2010-04-19
Data Structures and Algorithms · Computer Science
Online Minimum Spanning Trees with Weight Predictions
Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2023-02-24
Combinatorics · Mathematics
Algorithm for Constructing Related Spanning Directed Forests of Minimum Weight
Vasily Buslov
2025-02-18
Distributed, Parallel, and Cluster Computing · Computer Science
On the Design and Analysis of Parallel and Distributed Algorithms
Rajendra Purohit, K R Chowdhary, S D Purohit
2023-11-13
Distributed, Parallel, and Cluster Computing · Computer Science
Parallel Minimum Spanning Tree Algorithms and Evaluation
Suryanarayana Murthy Durbhakula
2020-05-15
Data Structures and Algorithms · Computer Science
Parallel Algorithms for Geometric Graph Problems
Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak, Grigory Yaroslavtsev
2014-01-07
Data Structures and Algorithms · Computer Science
Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
Nate Veldt, Thomas Stanley, Benjamin W. Priest, Trevor Steil +3
2025-02-19
Combinatorics · Mathematics
Parametric shortest-path algorithms via tropical geometry
Michael Joswig, Benjamin Schröter
2022-08-05
Optimization and Control · Mathematics
Precedence-Constrained Arborescences
Xiaochen Chou, Mauro Dell'Amico, Jafar Jamal, Roberto Montemanni
2023-05-15
Computational Complexity · Computer Science
A 4-Approximation Algorithm for k-Prize Collecting Steiner Tree Problems
Yusa Matsuda, Satoshi Takahashi
2018-02-20
Computational Geometry · Computer Science
When Crossings Count - Approximating the Minimum Spanning Tree
Sariel Har-Peled, Piotr Indyk
2009-09-29
Data Structures and Algorithms · Computer Science
Distributed Algorithms for Minimum Degree Spanning Trees
Michael Dinitz, Magnús M. Halldórsson, Calvin Newport
2018-06-12
Optimization and Control · Mathematics
A tree-based radial basis function method for noisy parallel surrogate optimization
Chenchao Shou, Matthew West
2019-08-22
Discrete Mathematics · Computer Science
On the minimum quartet tree cost problem
Sergio Consoli, Jan Korst, Gijs Geleijnse, Steffen Pauws
2018-07-03
Data Structures and Algorithms · Computer Science
Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems
Andre Linhares, Chaitanya Swamy
2016-05-12
Information Theory · Computer Science
Latent Tree Approximation in Linear Model
Navid Tafaghodi Khajavi
2017-10-06
Data Structures and Algorithms · Computer Science
Push-Down Trees: Optimal Self-Adjusting Complete Trees
Chen Avin, Kaushik Mondal, Stefan Schmid
2020-04-07
Computational Geometry · Computer Science
Minimum spanning blob-trees
Katharina Klost, Marc van Kreveld, Daniel Perz, Günter Rote +1
2025-03-05
Optimization and Control · Mathematics
Target-based Distributionally Robust Minimum Spanning Tree Problem
Yang Xu, Lianmin Zhang
2026-05-05
Computational Geometry · Computer Science
Approximating Spanning Trees with Low Crossing Number
Sariel Har-Peled
2009-07-08
Distributed, Parallel, and Cluster Computing · Computer Science
Parallelizing the Approximate Minimum Degree Ordering Algorithm: Strategies and Evaluation
Yen-Hsiang Chang, Aydın Buluç, James Demmel
2026-02-26
R2 v1 2026-06-21T08:28:28.395Z