(Almost) Tight bounds and existence theorems for single-commodity confluent flows
From MaRDI portal
(Redirected from Publication:3546347)
Recommendations
- Monotonicity and conformality in multicommodity network‐flow problems
- Equilibrium flow assignment in a single-commodity network
- On methods for the convex multi-commodity flow problem
- Single-Sink Multicommodity Flow with Side Constraints
- Approximating fractional multicommodity flow independent of the number of commodities
- Short proofs on multicommodity flows and cuts
- On the solitaire cone and its relationship to multi-commodity flows.
- (Almost) tight bounds and existence theorems for confluent flows
- scientific article; zbMATH DE number 508835
- Multicommodity flows over time: Efficient algorithms and complexity
Cited in
(26)- Maximum edge-disjoint paths in planar graphs with congestion 2
- A diameter-revealing proof of the Bondy-Lovász lemma
- Minmax regret for sink location on dynamic flow paths with general capacities
- The fluid mechanics of liquid democracy
- Treewidth of graphs with balanced separations
- Simple undirected two-commodity integral flow with a unitary demand
- Polynomial-time algorithms for special cases of the maximum confluent flow problem
- Traffic engineering of management flows by link augmentations on confluent trees
- (Almost) tight bounds and existence theorems for confluent flows
- Meet and merge: approximation algorithms for confluent flows
- The inapproximability of maximum single-sink unsplittable, priority and confluent flow problems
- Stochastic unsplittable flows
- Spanning tree congestion and computation of generalized Győri-Lovász partition
- Congestion-free rerouting of flows on DAGs
- A Survey on Spanning Tree Congestion
- A branch-and-bound algorithm for building optimal data gathering tree in wireless sensor networks
- Non-approximability and polylogarithmic approximations of the single-sink unsplittable and confluent dynamic flow problems
- Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows
- Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs
- Cluster before you hallucinate: node-capacitated network design and energy efficient routing
- Improved algorithms for optimal k sink location on path networks
- Connected partitions via connected dominating sets
- Separation number and treewidth, revisited
- Approximation algorithms for connected k-edge partition
- Minmax-regret k-sink location on a dynamic tree network with uniform capacities
- The Klein bottle and multicommodity flows
This page was built for publication: (Almost) Tight bounds and existence theorems for single-commodity confluent flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546347)
