Partial inverse maximum spanning tree in which weight can only be decreased under $$l_p$$ l p -norm

Xianyue Li, Zhao Zhang () and Ding-Zhu Du
Additional contact information
Xianyue Li: Lanzhou University
Zhao Zhang: Zhejiang Normal University
Ding-Zhu Du: University of Texas at Dallas

Journal of Global Optimization, 2018, vol. 70, issue 3, No 8, 677-685

Abstract: Abstract The maximum or minimum spanning tree problem is a classical combinatorial optimization problem. In this paper, we consider the partial inverse maximum spanning tree problem in which the weight function can only be decreased. Given a graph, an acyclic edge set, and an edge weight function, the goal of this problem is to decrease weights as little as possible such that there exists with respect to function containing the given edge set. If the given edge set has at least two edges, we show that this problem is APX-Hard. If the given edge set contains only one edge, we present a polynomial time algorithm.

Keywords: Partial inverse problem; Spanning tree; Polynomial time algorithm; Computational complexity (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://link.springer.com/10.1007/s10898-017-0554-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:jglopt:v:70:y:2018:i:3:d:10.1007_s10898-017-0554-5

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-017-0554-5

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().