Approximation algorithms for capacitated partial inverse maximum spanning tree problem

• Published in: Journal of global optimization Vol. 77; no. 2; pp. 319 - 340
• Main Authors: Li, Xianyue, Zhang, Zhao, Yang, Ruowang, Zhang, Heping, Du, Ding-Zhu
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.06.2020; Springer; Springer Nature B.V
• Subjects: Algorithms; Approximation; Computer Science; Decision trees; Graph theory; Mathematical analysis; Mathematics; Mathematics and Statistics; Operations Research/Decision Theory; Optimization; Real Functions; Weighting functions; Approximation algorithm; Spanning tree; Partial inverse problem
• ISSN: 0925-5001; 1573-2916
• DOI: 10.1007/s10898-019-00852-4

Given an edge weighted graph, and an acyclic edge set, the goal of the partial inverse maximum spanning tree problem is to modify the weight function as little as possible such that there exists a maximum spanning tree with respect to the new weight function containing the given edge set. In this paper, we consider this problem with capacitated constraint under the l p -norm, where p is an integer and p ∈ [ 1 , + ∞ ) . Firstly, we characterize the feasible solutions of this problem. Then, we present a k p -approximation algorithm for this problem when the weight function can only be decreased, where k is the number of edges in the given edge set. Finally, when the weight function can be either decreased and increased, we propose an approximation algorithm for the general case and analyse its approximation ratio. Moreover, we remark that these algorithms can be generalized under the weighted l p -norm and the weighted sum Hamming distance.