A distributed approximation algorithm for the minimum degree minimum weight spanning trees-Reference-Cited by-同舟云学术

A distributed approximation algorithm for the minimum degree minimum weight spanning trees

Published:2008-02 Issue:2 Volume:68 Page:200-208
ISSN:0743-7315
Container-title:Journal of Parallel and Distributed Computing
language:en
Short-container-title:Journal of Parallel and Distributed Computing

Author:

Lavault Christian,Valencia-Pabon Mario

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference9 articles.

1. Optimal distributed algorithms for minimum weight spanning tree;Awerbuch,1987

2. The first approximated distributed algorithm for the minimum degree spanning tree problem on general graphs;Blin;Internat. J. Fond. Comput. Sci.,2004

3. What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs;Chaudhuri,2005

4. T. Fischer, Optimizing the degree of minimum weight spanning trees, Technical Report 93-1338, Department of Computer Science, Cornell University, Ithaca, NY, USA, 1993.

5. Approximating the minimum degree spanning tree to within one from the optimal degree;Fürer;J. Algorithms,1994

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Discriminative information restoration and extraction for weakly supervised low-resolution fine-grained image recognition;Pattern Recognition;2022-07

2. Load balancing for RPL-based Internet of Things: A review;Ad Hoc Networks;2021-05

3. Distributed Minimum Degree Spanning Trees;Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing;2019-07-16

4. Public Key-Based Lightweight Swarm Authentication;Cyber-Physical Systems Security;2018

5. Construction of Tree Network with Limited Delivery Latency in Homogeneous Wireless Sensor Networks;Wireless Personal Communications;2014-04-12