Title: An algorithm for inverse minimum spanning tree problem
Abstract:Abstract In this paper we consider an inverse minimum spanning tree problem in which we wish to change the original weights of the edges in a graph as little as possible so that a given spanning tree ...Abstract In this paper we consider an inverse minimum spanning tree problem in which we wish to change the original weights of the edges in a graph as little as possible so that a given spanning tree of the graph can become the minimum spanning tree. An algorithm is proposed which can solve the problem in polynomial time. The algorithm is a combinatorial method that uses the minimum covering problem as its main subproblem. An example is included to illustrate the method Keywords: Spanning TreeInverse ProblemMinimum Covering SetBipartite Graph ∗The research of this author is supported by the Universities Grant Council of Hong Kong (CERG-CITYU-9040189) †The author gratefully acknowledges the partial support of AFOSR (Grant F49620-93-1-0041) ‡The author is grateful to the partial support of the Croucher Foundation of Hong Kong (Grant 9050030) ∗The research of this author is supported by the Universities Grant Council of Hong Kong (CERG-CITYU-9040189) †The author gratefully acknowledges the partial support of AFOSR (Grant F49620-93-1-0041) ‡The author is grateful to the partial support of the Croucher Foundation of Hong Kong (Grant 9050030) Notes ∗The research of this author is supported by the Universities Grant Council of Hong Kong (CERG-CITYU-9040189) †The author gratefully acknowledges the partial support of AFOSR (Grant F49620-93-1-0041) ‡The author is grateful to the partial support of the Croucher Foundation of Hong Kong (Grant 9050030)Read More
Publication Year: 1997
Publication Date: 1997-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 41
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot