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 9 in Inverse Combinatorial Optimization Problems, 2025, pp 215-229 from Springer

Abstract: Abstract In this chapter, we delve into the inverse minimum spanning tree (IMST) problems under various norm constraints, including the l 1 $$l_1$$ , l ∞ $$l_\infty $$ norms and the weighted Hamming distance. We present mathematical formulations and propose efficient algorithms tailored to each scenario. The bounded IMST problem under the unit l 1 $$l_1$$ norm is reformulated as a maximum flow problem, which can be effectively solved within O ( m 8 log m ) $$O(m^8 \log m)$$ . In contrast, the unbounded IMST problem under the unit l 1 $$l_1$$ norm is transformed into an unbalanced assignment problem, solvable in O ( n 2 m ) $$O(n^2m)$$ time. Furthermore, this problem is also cast as a minimum cost flow problem, solvable in O ( n 2 log n ) $$O(n^2 \log n)$$ time. When considering the unbounded IMST problem under the weighted l 1 $$l_1$$ norm, it is mapped onto an unbalanced transportation problem, with a solution time of O ( n 2 m log ( nc ) ) $$O(n^2m\log (nc))$$ , where C = max { | c j | : a j ∈ A } $$C = \max \{|c_j| : a_j \in A\}$$ . The unbounded IMST problem under the unit l ∞ $$l_\infty $$ norm is more straightforward, admitting a solution in O ( n 2 ) $$O(n^2)$$ time. For the bounded IMST problem under the weighted sum Hamming distance, we have transformed it into a minimum-weight node cover problem of a bipartite graph, which can be addressed in O ( n 3 m ) $$O(n^3m)$$ time. Employing the binary method, the constrained bounded IMST problem under the weighted bottleneck Hamming distance is also transformed into a minimum-weight node cover problem of a bipartite graph, with a solution time of O ( n 3 m log m ) $$O(n^3m\log m)$$ .

Keywords: Inverse minimum spanning tree problems; Maximum flow problem; Unbalanced assignment problem; Unbalanced transportation problem (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_9

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

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

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 ().