Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
type: Item
instance of: scholarly article
title: Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
zbMATH Open document ID: 1145.68038
author: Longcheng Liu
author: Enyu Yao
published in: Theoretical Computer Science
publication date: 2008-05-28T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5279821
zbMATH Keywords: min-max spanning tree
zbMATH Keywords: inverse problem
zbMATH Keywords: Hamming distance
zbMATH Keywords: strongly polynomial algorithms
MaRDI profile type: Publication
full work available at URL: j.tcs.2007.12.006
OpenAlex ID: W2129343799
cites work: The Min-Max Spanning Tree Problem and some extensions
cites work: Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
cites work: Inverse combinatorial optimization: a survey on problems, methods, and results
cites work: Weighted inverse minimum spanning tree problems under Hamming distance
cites work: Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
cites work: The center location improvement problem under the Hamming distance
cites work: Computing and Combinatorics
cites work: Inverse maximum flow problems under the weighted Hamming distance
cites work: A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
cites work: Q3056948
DOI: 10.1016/J.TCS.2007.12.006
description: scientific article; zbMATH DE number 5279821