最小路由代价生成树的并行化近似算法
数据结构与算法
2007-07-04 v2 计算复杂性
摘要
我们将先前提出的用于最小路由代价生成树问题及相关问题的若干算法进行了并行化。
引用
@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}
}
相关论文
查看更多相关论文 →
分布式、并行与集群计算 · 计算机科学
Distributed Approximation of Minimum Routing Cost Trees
Alexandra Hochuli, Stephan Holzer, Roger Wattenhofer
2014-06-06
数据结构与算法 · 计算机科学
Balancing Minimum Spanning and Shortest Path Trees
Samir Khuller, Balaji Raghavachari, Neal E. Young
2015-06-02
分布式、并行与集群计算 · 计算机科学
A Distributed Parallel Algorithm for Minimum Spanning Tree Problem
Artem Mazeev, Alexander Semenov, Alexey Simonov
2016-10-18
最优化与控制 · 数学
A parallel framework for graphical optimal transport
Jiaojiao Fan, Isabel Haasler, Qinsheng Zhang, Johan Karlsson +1
2025-12-02
计算复杂性 · 计算机科学
On the approximability of robust spanning tree problems
Adam Kasperski, Pawel Zielinski
2010-04-19
数据结构与算法 · 计算机科学
Online Minimum Spanning Trees with Weight Predictions
Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2023-02-24
组合数学 · 数学
Algorithm for Constructing Related Spanning Directed Forests of Minimum Weight
Vasily Buslov
2025-02-18
分布式、并行与集群计算 · 计算机科学
On the Design and Analysis of Parallel and Distributed Algorithms
Rajendra Purohit, K R Chowdhary, S D Purohit
2023-11-13
分布式、并行与集群计算 · 计算机科学
Parallel Minimum Spanning Tree Algorithms and Evaluation
Suryanarayana Murthy Durbhakula
2020-05-15
数据结构与算法 · 计算机科学
Parallel Algorithms for Geometric Graph Problems
Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak, Grigory Yaroslavtsev
2014-01-07
数据结构与算法 · 计算机科学
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
组合数学 · 数学
Parametric shortest-path algorithms via tropical geometry
Michael Joswig, Benjamin Schröter
2022-08-05
最优化与控制 · 数学
Precedence-Constrained Arborescences
Xiaochen Chou, Mauro Dell'Amico, Jafar Jamal, Roberto Montemanni
2023-05-15
计算复杂性 · 计算机科学
A 4-Approximation Algorithm for k-Prize Collecting Steiner Tree Problems
Yusa Matsuda, Satoshi Takahashi
2018-02-20
计算几何 · 计算机科学
When Crossings Count - Approximating the Minimum Spanning Tree
Sariel Har-Peled, Piotr Indyk
2009-09-29
数据结构与算法 · 计算机科学
Distributed Algorithms for Minimum Degree Spanning Trees
Michael Dinitz, Magnús M. Halldórsson, Calvin Newport
2018-06-12
最优化与控制 · 数学
A tree-based radial basis function method for noisy parallel surrogate optimization
Chenchao Shou, Matthew West
2019-08-22
离散数学 · 计算机科学
On the minimum quartet tree cost problem
Sergio Consoli, Jan Korst, Gijs Geleijnse, Steffen Pauws
2018-07-03
数据结构与算法 · 计算机科学
Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems
Andre Linhares, Chaitanya Swamy
2016-05-12
信息论 · 计算机科学
Latent Tree Approximation in Linear Model
Navid Tafaghodi Khajavi
2017-10-06
数据结构与算法 · 计算机科学
Push-Down Trees: Optimal Self-Adjusting Complete Trees
Chen Avin, Kaushik Mondal, Stefan Schmid
2020-04-07
计算几何 · 计算机科学
Minimum spanning blob-trees
Katharina Klost, Marc van Kreveld, Daniel Perz, Günter Rote +1
2025-03-05
最优化与控制 · 数学
Target-based Distributionally Robust Minimum Spanning Tree Problem
Yang Xu, Lianmin Zhang
2026-05-05
计算几何 · 计算机科学
Approximating Spanning Trees with Low Crossing Number
Sariel Har-Peled
2009-07-08
分布式、并行与集群计算 · 计算机科学
Parallelizing the Approximate Minimum Degree Ordering Algorithm: Strategies and Evaluation
Yen-Hsiang Chang, Aydın Buluç, James Demmel
2026-02-26