Most and least uniform spanning trees

DOI10.1016/0166-218X(86)90041-7zbMath0611.05014MaRDI QIDQ1087546

Francesco Maffioli, Silvano Martello, Paolo M. Camerini, Paolo Toth

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmminimum weightbottleneck problemsmaximum weightleast uniform problemmatroid generalizationsmost uniform problemspannig tree

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

On finding most uniform spanning trees, Minimum dispersion problems, A strongly polynomial algorithm for the uniform balanced network flow problem, The balanced traveling salesman problem, A branch-and-cut algorithm for the balanced traveling salesman problem, Nash balanced assignment problem, Balanced Optimization with Vector Costs, COMPUTATIONAL METHODS FOR LOGISTICS PROBLEMS RELATED TO OPTIMAL TREES, An inverse model for the most uniform problem, The image of weighted combinatorial problems, Quadratic bottleneck problems, Robust balanced optimization, Exact algorithms for the equitable traveling salesman problem, Balanced paths in acyclic networks: Tractable cases and related approaches, In memoriam Paolo M. Camerini, The balanced linear programming problem, Solving combinatorial problems with combined min-max-min-sum objective and applications, The minimum labeling spanning trees, The quadratic balanced optimization problem

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Balanced optimization problems
• Complexity of spanning tree problems: Part I
• The Min-Max Spanning Tree Problem and some extensions
• An Algorithm for the Bottleneck Traveling Salesman Problem
• The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic
• A note on finding optimum branchings
• Thek best spanning arborescences of a network
• Efficiency of a Good But Not Linear Set Union Algorithm
• Finding optimum branchings
• The Bounded Path Tree Problem
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item