Partial Inverse Minimum Spanning Tree Problems

Xiucui Guan, Panos M. Pardalos and Binwu Zhang
Additional contact information
Xiucui Guan: Southeast University
Binwu Zhang: Hohai University

Chapter Chapter 12 in Inverse Combinatorial Optimization Problems, 2025, pp 283-310 from Springer

Abstract: Abstract This chapter introduces the partial inverse minimum spanning tree problem (PInvMST). Given an edge-weighted graph and an acyclic edge set, the target of (PInvMST) is to get a new weight vector such that the given edge set is included in some minimum spanning tree with respect to the new weight vector, and the difference between the two vectors is minimum. Firstly, we show the computational complexities of (PInvMST) in some special cases and general case under different norms and provide exact algorithms for polynomial time solvable cases. Then, for some cases that have been proven to be N P $$\mathcal {N}\mathcal {P}$$ -hard, we introduce their approximation algorithms and analyze their approximation ratios. Finally, we summarize the conclusion and look forward to future works.

Keywords: Partial inverse minimum spanning tree problems; Polynomial time algorithms; N P $$\mathcal {N}\mathcal {P}$$ -hardness; Fitted cut; Approximation algorithms (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-031-91175-0_12

Ordering information: This item can be ordered from
http://www.springer.com/9783031911750

DOI: 10.1007/978-3-031-91175-0_12

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().