Parallel approximation algorithms for minimum routing cost spanning tree

Authors:
Kun Chen;Yung En Hsieh;Ping Jung Lu
Affiliations:
Department of Computer Science and Information Engineering, National Taiwan University, No. 1, Sec. 4, Roosevelt Rd., Taipei 10617, Taiwan;Department of Computer Science and Information Engineering, National Taiwan University, No. 1, Sec. 4, Roosevelt Rd., Taipei 10617, Taiwan;Department of Computer Science and Information Engineering, National Taiwan University, No. 1, Sec. 4, Roosevelt Rd., Taipei 10617, Taiwan
Venue:
International Journal of Computational Science and Engineering
Year:
2013

Citing 2
Cited 0

A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees

SIAM Journal on Computing
Fast minimum spanning tree for large graphs on the GPU

Proceedings of the Conference on High Performance Graphics 2009

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the popularity of internet, more and more data is transferred in the network. With the enormous information, the network bandwidth is still a bottleneck. The internet must provide high quality of service to ensure that the information can be transferred fluently. There are some common factors that can affect the quality of services, such as delay time, building cost, routing cost, loss probability, and bandwidth. Estimation of some factors, such as building cost, can be solved in polynomial time, but the estimations of other factors, such as finding the minimum routing cost spanning tree MRCT, are NP-hard problems. In this paper, we focus on improving two MRCT approximation algorithms 2 and 15/8 approximation with parallel-computing methods and obtain the impressive experiment results with reduced calculation time.