The Min-Max Spanning Tree Problem and some extensions

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of matroids and geometric lattices (05B35) Algorithms in computer science (68W99)

Cites Work

Title not available (Why is that?)
Depth-First Search and Linear Graph Algorithms
Finding optimum branchings
On the computational power of pushdown automata
Parallel concepts in graph theory
Two Algorithms for Generating Weighted Spanning Trees in Order
Title not available (Why is that?)
Finding Minimum Spanning Trees
Finding the median
An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees

Cited In (57)

Assessing the effect of multiple cost changes using reverse set tolerances
Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance
On efficient algorithms for bottleneck path problems with many sources
The constrained Bottleneck spanning tree problem with upgrades
Proportional fairness for combinatorial optimization
A note on upgrading the min–max weight of a base of a matroid
Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making
Constrained inverse min-max spanning tree problems under the weighted Hamming distance
Lexicographic balanced optimization problems
Dynamic bottleneck optimization for \(k\)-edge and 2-vertex connectivity
Partial inverse min-max spanning tree problem
The minimum moving spanning tree problem
Arborescence optimization problems solvable by Edmonds' algorithm
The partial sum criterion for Steiner trees in graphs and shortest paths
Constrained matroidal bottleneck problems
Cuttings for disks and axis-aligned rectangles in three-space
The Minimum Moving Spanning Tree Problem
Title not available (Why is that?)
Quadratic bottleneck problems
Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding
Approximate spanning cactus
Possibilistic bottleneck combinatorial optimization problems with ill-known weights
Algorithms for Euclidean Degree Bounded Spanning Tree Problems
Bounded-angle minimum spanning trees
Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
A linear time algorithm for the maximum capacity path problem
Title not available (Why is that?)
On some multicriteria arborescence problems: Complexity and algorithms
Upgrading min-max spanning tree problem under various cost functions
The tricriterion shortest path problem with at least two bottleneck objective functions
Solving the 2-rooted mini-max spanning forest problem by branch-and-bound
Most and least uniform spanning trees
Online learning for min-max discrete problems
The image of weighted combinatorial problems
Minmax regret solutions for minimax optimization problems with uncertainty
An algebraic framework for minimum spanning tree problems
On weighting two criteria with a parameter in combinatorial optimization problems
The bottleneck \(k\)-MST
In memoriam Paolo M. Camerini
The minimum labeling spanning trees
Maximum weight archipelago subgraph problem
Euclidean bottleneck bounded-degree spanning tree ratios
Minimum deviation and balanced optimization: A unified approach
Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
Degree bounded bottleneck spanning trees in three dimensions
An efficient heuristic algorithm for the bottleneck traveling salesman problem
k-sum optimization problems
A class of bottleneck expansion problems
On combined minmax-minsum optimization
Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
A linear time algorithm for the bottleneck biconnected spanning subgraph problem
Complexity of spanning tree problems: Part I
Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
A fast algorithm for a class of bottleneck problems
Solving some lexicographic multi-objective combinatorial problems
Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance

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)