Inverse min-max spanning tree problem under the weighted sum-type Hamming distance

DOI10.1016/j.tcs.2007.12.006zbMath1145.68038OpenAlexW2129343799MaRDI QIDQ924129

Enyu Yao, Longcheng Liu

Publication date: 28 May 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.12.006

zbMATH Keywords

inverse problemHamming distancestrongly polynomial algorithmsmin-max spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Related Items

An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance ⋮ Approximation algorithms for capacitated partial inverse maximum spanning tree problem ⋮ Upgrading min-max spanning tree problem under various cost functions ⋮ Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance ⋮ Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance ⋮ Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance ⋮ Weighted inverse maximum perfect matching problems under the Hamming distance ⋮ On inverse linear programming problems under the bottleneck-type weighted Hamming distance ⋮ Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm ⋮ Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance ⋮ The minmax regret inverse maximum weight problem ⋮ Inverse minimum flow problem under the weighted sum-type Hamming distance ⋮ The lower bounded inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm ⋮ Capacitated partial inverse maximum spanning tree under the weighted Hamming distance ⋮ Inverse minimum cost flow problems under the weighted Hamming distance ⋮ Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance ⋮ Constrained inverse minimum flow problems under the weighted Hamming distance ⋮ Partial inverse maximum spanning tree problem under the Chebyshev norm ⋮ Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks

Cites Work

• Unnamed Item
• The Min-Max Spanning Tree Problem and some extensions
• Weighted inverse minimum spanning tree problems under Hamming distance
• The center location improvement problem under the Hamming distance
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse maximum flow problems under the weighted Hamming distance
• Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
• Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
• A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
• Computing and Combinatorics