The Min-Max Spanning Tree Problem and some extensions
From MaRDI portal
Publication:1244239
Cites work
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- scientific article; zbMATH DE number 3557512 (Why is no real title available?)
- An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
- Depth-First Search and Linear Graph Algorithms
- Finding Minimum Spanning Trees
- Finding optimum branchings
- Finding the median
- On the computational power of pushdown automata
- Parallel concepts in graph theory
- Two Algorithms for Generating Weighted Spanning Trees in Order
Cited in
(57)- Assessing the effect of multiple cost changes using reverse set tolerances
- The constrained Bottleneck spanning tree problem with upgrades
- Proportional fairness for combinatorial optimization
- Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance
- On efficient algorithms for bottleneck path problems with many sources
- A note on upgrading the min–max weight of a base of a matroid
- The bottleneck \(k\)-MST
- Minimum deviation and balanced optimization: A unified approach
- In memoriam Paolo M. Camerini
- k-sum optimization problems
- Solving some lexicographic multi-objective combinatorial problems
- Arborescence optimization problems solvable by Edmonds' algorithm
- Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
- Possibilistic bottleneck combinatorial optimization problems with ill-known weights
- Partial inverse min-max spanning tree problem
- Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance
- The minimum moving spanning tree problem
- Complexity of spanning tree problems: Part I
- An efficient heuristic algorithm for the bottleneck traveling salesman problem
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
- scientific article; zbMATH DE number 7662164 (Why is no real title available?)
- Quadratic bottleneck problems
- The Minimum Moving Spanning Tree Problem
- On some multicriteria arborescence problems: Complexity and algorithms
- A fast algorithm for a class of bottleneck problems
- An algebraic framework for minimum spanning tree problems
- Upgrading min-max spanning tree problem under various cost functions
- Approximate spanning cactus
- A class of bottleneck expansion problems
- A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
- On combined minmax-minsum optimization
- Bounded-angle minimum spanning trees
- Algorithms for Euclidean degree bounded spanning tree problems
- Solving the 2-rooted mini-max spanning forest problem by branch-and-bound
- Lexicographic balanced optimization problems
- Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
- The image of weighted combinatorial problems
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin-Marsten bounding
- Most and least uniform spanning trees
- Cuttings for disks and axis-aligned rectangles in three-space
- Constrained matroidal bottleneck problems
- On weighting two criteria with a parameter in combinatorial optimization problems
- Maximum weight archipelago subgraph problem
- The minimum labeling spanning trees
- Degree bounded bottleneck spanning trees in three dimensions
- The tricriterion shortest path problem with at least two bottleneck objective functions
- A linear time algorithm for the maximum capacity path problem
- Euclidean bottleneck bounded-degree spanning tree ratios
- A linear time algorithm for the bottleneck biconnected spanning subgraph problem
- scientific article; zbMATH DE number 7255037 (Why is no real title available?)
- Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making
- Constrained inverse min-max spanning tree problems under the weighted Hamming distance
- Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
- Dynamic bottleneck optimization for \(k\)-edge and 2-vertex connectivity
- Minmax regret solutions for minimax optimization problems with uncertainty
- The partial sum criterion for Steiner trees in graphs and shortest paths
- Online learning for min-max discrete problems
This page was built for publication: The Min-Max Spanning Tree Problem and some extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1244239)
