Upgrading min-max spanning tree problem under various cost functions
type: Item
instance of: scholarly article
title: Upgrading min-max spanning tree problem under various cost functions
zbMATH Open document ID: 1382.68123
author: Ali Reza Sepasian
author: Ehsan Monabbati
published in: Theoretical Computer Science
publication date: 2017-11-16T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6807600
zbMATH Keywords: location problems
zbMATH Keywords: upgrading problems
zbMATH Keywords: min-max spanning tree
MaRDI profile type: Publication
full work available at URL: j.tcs.2017.08.006
OpenAlex ID: W2752698094
cites work: Network upgrading problems
cites work: Q4789852
cites work: Maximizing the minimum source-sink path subject to a budget constraint
cites work: Edge Weight Reduction Problems in Directed Acyclic Graphs
cites work: The network inhibition problem
cites work: Up- and downgrading the 1-center in a network
cites work: A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
cites work: Upgrading \(p\)-median problem on a path
cites work: Modifying edges of a network to obtain short subgraphs
cites work: Increasing the Weight of Minimum Spanning Trees
cites work: Approximation algorithms for certain network improvement problems
cites work: Improving spanning trees by upgrading nodes
cites work: Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
cites work: The Min-Max Spanning Tree Problem and some extensions
cites work: Stochastic bottleneck spanning tree problem
cites work: The Constrained Bottleneck Problem in Networks
cites work: An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem
cites work: Minimum bottleneck spanning trees with degree bounds
cites work: Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
cites work: Constrained inverse min-max spanning tree problems under the weighted Hamming distance
cites work: Q3129922
DOI: 10.1016/J.TCS.2017.08.006
Recommended article: Improving Minimum Cost Spanning Trees by Upgrading Nodes
Recommended article: Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
Recommended article: Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
Recommended article: A generalization of the minimum branch vertices spanning tree problem
Recommended article: Approximating minimum-cost graph problems with spanning tree edges
Recommended article: A linear programming approach to increasing the weight of all minimum spanning trees
Recommended article: Q3368660
Recommended article: Optimality computation of the minimum stretch spanning tree problem
Recommended article: On the generalized minimum spanning tree problem
Recommended article: Updating Directed Minimum Cost Spanning Trees
description: scientific article; zbMATH DE number 6807600