NDLI: A parallel algorithm for the degree-constrained minimum spanning tree problem using nearest-neighbor chains

Content Provider	IEEE Xplore Digital Library
Author	Li-Jen Mao Narsingh Deo Sheau-Dong Lang
Copyright Year	1999
Description	Author affiliation: Dept. of Comput. Sci., Central Florida Univ., Orlando, FL, USA (Li-Jen Mao)
Abstract	The Minimum Spanning Tree (MST) problem with an added constraint that no node in the spanning tree has the degree more than a specified integer d, is known as the Degree-Constrained MST (d-MST) problem. Since computing the d-MST is NP-hard for every d in the range 2/spl les/d/spl les/(n-2) where n denotes the total number of nodes, several approximate algorithms have been proposed in the literature. We have previously proposed two approximate algorithms, TC-RNN and IR, for the d-MST problem (L.J. Mao et al., 1997). Our experimental results show that while the IR algorithm is faster, the TC-RNN algorithm consistently produces spanning trees with a smaller weight. We propose a new algorithm, TC-NNC, which is an improved version of TC-RNN. Our experiments using randomly generated, weighted graphs as input, demonstrate that the execution time of TC-NNC is smaller than that of TC-RNN, and is very close to that of IR. Further, the quality-of-solution of TC-NNC is better than that of IR and is very close to that of TC-RNN.
Starting Page	184
Ending Page	189
File Size	66148
Page Count	6
File Format	PDF
ISBN	0769502318
ISSN	10874089
DOI	10.1109/ISPAN.1999.778937
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1999-06-23
Publisher Place	Australia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Parallel algorithms Tree graphs Polynomials Computer science Nearest neighbor searches Silicon compounds Approximation algorithms Traveling salesman problems NP-hard problem Additives
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Parallel algorithms for the degree-constrained minimum spanning tree problem using nearest-neighbor chains and the heap-traversal technique

An effective ant-based algorithm for the degree-constrained minimum spanning tree problem

Implementation of Heuristics for Solving Travelling Salesman Problem Using Nearest Neighbour and Minimum Spanning Tree Algorithms

Press and jump algorithm for traveling salesman problem

A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest Neighbor Chains (1998)

Minimum Bounded Degree Spanning Trees

A 2opt-DPX genetic local search for solving symmetric traveling salesman problem

Approximate algorithms for the traveling salesperson problem

A new approach to the degree-constrained minimum spanning tree problem using genetic algorithm

A parallel algorithm for the degree-constrained minimum spanning tree problem using nearest-neighbor chains

Similar Documents

Parallel algorithms for the degree-constrained minimum spanning tree problem using nearest-neighbor chains and the heap-traversal technique

An effective ant-based algorithm for the degree-constrained minimum spanning tree problem

Implementation of Heuristics for Solving Travelling Salesman Problem Using Nearest Neighbour and Minimum Spanning Tree Algorithms

Press and jump algorithm for traveling salesman problem

A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest Neighbor Chains (1998)

Minimum Bounded Degree Spanning Trees

A 2opt-DPX genetic local search for solving symmetric traveling salesman problem

Approximate algorithms for the traveling salesperson problem

A new approach to the degree-constrained minimum spanning tree problem using genetic algorithm

A parallel algorithm for the degree-constrained minimum spanning tree problem using nearest-neighbor chains