Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm

DOI10.1007/978-3-030-92681-6_31OpenAlexW4206609734MaRDI QIDQ2150566

Xianyue Li, Zhao Zhang, Heping Zhang, Ruowang Yang

Publication date: 29 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_31

zbMATH Keywords

polynomial time algorithmspanning treepartial inverse problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Approximation algorithms for capacitated partial inverse maximum spanning tree problem ⋮ Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance

Cites Work

• Algorithms for the partial inverse matroid problem in which weights can only be increased
• Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
• Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm
• Approximation algorithms for capacitated partial inverse maximum spanning tree problem
• Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
• Correction to: ``A de Bruijn-Erdős theorem in graphs?
• The partial inverse minimum spanning tree problem when weight increase is forbidden
• Algorithm for constraint partial inverse matroid problem with weight increase forbidden
• Partial inverse assignment problems under \(l_{1}\) norm
• Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem
• The partial inverse minimum cut problem withL₁-norm is strongly NP-hard
• Computational Difficulties of Bilevel Linear Programming
• New Branch-and-Bound Rules for Linear Bilevel Programming

This page was built for publication: Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm