Minimax flow tree problems

DOI10.1002/NET.20313MaRDI QIDQ3057112zbMATH OpenOpenAlexFDO

Authors Hui Chen, Ann Melissa Campbell, Barrett W. Thomas, Arie Tamir

Publication date 24 November 2010

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20313

zbMATH Keywords

complexityflowminimaxshortest path treestrees

Mathematics Subject Classification ID

Flows in graphs (05C21) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10)

Recommendations

• scientific article; zbMATH DE number 3864952
• Optimal flow trees for networks with general nonlinear arc costs
• Multicommodity flows in tree-like networks
• A computational study of minimax flow centers in trees
• On a tree-shaped facility location problem of Minieka

Cites work

• A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
• A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An improved algorithm for the k-source maximum eccentricity spanning trees
• An Optimal Synchronizer for the Hypercube
• Approximating \(k\)-hop minimum-spanning trees
• Approximation algorithms for some optimum communication spanning tree problems
• Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Minimum Diameter Spanning Trees and Related Problems
• Minimum eccentricity multicast trees
• Multi-source spanning trees: Algorithms for minimizing source eccentricities.
• Multicommodity flow models for spanning trees with hop constraints
• Network design for time‐constrained delivery
• Off-Line Maintenance of Planar Configurations
• On the minimum diameter spanning tree problem
• Optimum Communication Spanning Trees
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Shipment Routing Algorithms with Tree Constraints
• The 2-hop spanning tree problem
• The complexity of minimizing certain cost metrics for k-source spanning trees.
• The complexity of the network design problem
• Tree Spanners
• Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
• Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints

Cited in

(4)

• General network design: a unified view of combined location and network design problems
• Network design for time-constrained delivery using subgraphs
• Network design for time‐constrained delivery
• Min-max Computation Tree Logic

This page was built for publication: Minimax flow tree problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3057112)