Exact arborescences, matchings and cycles
Discrete Applied Mathematics
Computer algorithms: introduction to design and analysis
Computer algorithms: introduction to design and analysis
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
The complexity of restricted spanning tree problems
Journal of the ACM (JACM)
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
Algorithms in C
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
| Hi-index | 0.01 |
Given an integer α and an undirected graph with edges associated with integer weights, the spanning tree detection problem (STDP) is to find, if one exists, a spanning tree of weight α. STDP is NP-hard. In this paper we develop both approximate and exact algorithms to solve STDP. Approximate algorithm consists of a greedy method to construct an initial spanning tree quickly, and a local search method that improves the weight of the tree successively toward α. To solve STDP completely, we take a 'divide and conquer' approach and develop an exact algorithm. These algorithms are implemented in C language and we conduct some numerical tests to evaluate the performance of the developed algorithms for various types and sizes of instances. In most cases, we are able to solve STDPs with up to 1000 nodes in less than a few seconds. Moreover, to solve harder instances we try tabu search as well, and mention how the developed algorithm can be modified to list up all the spanning trees of weight α.