Pages that link to "Item:Q5471480"
From MaRDI portal
The following pages link to A TREE PARTITIONING PROBLEM ARISING FROM AN EVACUATION PROBLEM IN TREE DYNAMIC NETWORKS (Q5471480):
Displaying 6 items.
- An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks (Q860399) (← links)
- Polynomial-time algorithms for special cases of the maximum confluent flow problem (Q2434729) (← links)
- Distributed Evacuation in Graphs with Multiple Exits (Q2835028) (← links)
- Sink Evacuation on Trees with Dynamic Confluent Flows (Q4636507) (← links)
- Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems (Q5136261) (← links)
- Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows (Q6107888) (← links)