An approximation algorithm for the balanced capacitated minimum spanning tree problem

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

FALLAH H.; DIDEHVAR F.; RAHMATI F.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Scientia Iranica Year:2021 | Volume:28 | Issue:3 (Transactions D: Computer Science and Engineering and Electrical Engineering) Page(s): 1479-1492

Download Full-Text

View:

112

Download:

Cites:

Information Journal Paper

Title

An approximation algorithm for the balanced capacitated minimum spanning tree problem

Author(s)

FALLAH H. | DIDEHVAR F. | RAHMATI F. | Issue Writer Certificate

Keywords

Capacitated minimum spanning tree problem

Load balancing

Approximation algorithms

PTAS

Abstract

Capacitated minimum spanning tree problem (CMSTP), a well-known combinatorial optimization problem, holds the central place in telecommunication network design. This problem involves nding a minimum cost spanning tree with an extra cardinality limitation on the orders of the subtrees incident to a certain root node. The Balanced Capacitated minimum spanning tree problem (BCMSTP) is a special case that aims to balance the orders of the subtrees. This problem is an NP-hard one and presents two Approximation algorithms in this paper. By considering the maximum order of the subtrees Q, a (3 􀀀 1Q )-approximation algorithm was provided to nd a balanced solution. This result was improved to a (2: 5 + ) approximation algorithm (for every given > 0) in the 2d-Euclidean spaces. Also, a Polynomial Time Approximation Scheme (PTAS) was presented for CMSTP.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

FALLAH, H., DIDEHVAR, F., & RAHMATI, F.. (2021). An approximation algorithm for the balanced capacitated minimum spanning tree problem. SCIENTIA IRANICA, 28(3 (Transactions D: Computer Science and Engineering and Electrical Engineering)), 1479-1492. SID. https://sid.ir/paper/978185/en

Vancouver: Copy

FALLAH H., DIDEHVAR F., RAHMATI F.. An approximation algorithm for the balanced capacitated minimum spanning tree problem. SCIENTIA IRANICA[Internet]. 2021;28(3 (Transactions D: Computer Science and Engineering and Electrical Engineering)):1479-1492. Available from: https://sid.ir/paper/978185/en

IEEE: Copy

H. FALLAH, F. DIDEHVAR, and F. RAHMATI, “An approximation algorithm for the balanced capacitated minimum spanning tree problem,” SCIENTIA IRANICA, vol. 28, no. 3 (Transactions D: Computer Science and Engineering and Electrical Engineering), pp. 1479–1492, 2021, [Online]. Available: https://sid.ir/paper/978185/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops