Meet and merge: approximation algorithms for confluent flows
From MaRDI portal
Publication:2495396
DOI10.1016/j.jcss.2005.09.009zbMath1103.90024OpenAlexW2060085144MaRDI QIDQ2495396
Rajmohan Rajaraman, Jiangzhuo Chen, Ravi Sundaram
Publication date: 30 June 2006
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2005.09.009
Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)
Related Items (4)
The fluid mechanics of liquid democracy ⋮ Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows ⋮ Polynomial-time algorithms for special cases of the maximum confluent flow problem ⋮ Stochastic Unsplittable Flows
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- The directed subgraph homeomorphism problem
- Designing multi-commodity flow trees
- Broadcasting on trees and the Ising model.
- The geometry of graphs and some of its algorithmic applications
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- On the Distribution of the Number of Successes in Independent Trials
- Maximal Flow Through a Network
- Meet and merge
- Bicriteria Network Design Problems
- An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
- Approximation algorithms for the covering Steiner problem
- Chernoff–Hoeffding Bounds for Applications with Limited Independence
- Bounded branching process and and/or tree evaluation
- Provisioning a virtual private network
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
This page was built for publication: Meet and merge: approximation algorithms for confluent flows
