## Stem multicommod$ (all stems)

### 17 papers:

- STOC-2012-KelnerMP #approximate #multi #performance #using
- Faster approximate multicommodity flow using quadratically coupled flows (JAK, GLM, RP), pp. 1–18.
- STOC-2010-Madry #algorithm #approximate #graph #multi #performance #problem
- Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms (AM), pp. 121–130.
- STOC-2006-FleischerKLS #multi #probability
- Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree (LF, JK, SL, GS), pp. 663–670.
- STOC-2005-CharikarK #design #multi #network #on the
- On non-uniform multicommodity buy-at-bulk network design (MC, AK), pp. 176–182.
- STOC-2005-ChekuriKS #multi #problem
- Multicommodity flow, well-linked terminals, and routing problems (CC, SK, FBS), pp. 183–192.
- STOC-2004-ChekuriKS #multi #problem
- The all-or-nothing multicommodity flow problem (CC, SK, FBS), pp. 156–165.
- ICALP-2003-ChekuriMS #multi
- Multicommodity Demand Flow in a Tree (CC, MM, FBS), pp. 410–425.
- ICALP-2003-HallHS #algorithm #complexity #multi #performance
- Multicommodity Flows over Time: Efficient Algorithms and Complexity (AH, SH, MS), pp. 397–409.
- ICEIS-v2-2003-OkuharaU #multi #problem
- Logistics By Applying Evolutionary Computation to Multicommodity Flow Problem (KO, NU), pp. 511–514.
- STOC-2001-GuptaKKRY #design #multi #network #problem
- Provisioning a virtual private network: a network design problem for multicommodity flow (AG, JMK, AK, RR, BY), pp. 389–398.
- STOC-1995-KargerP #combinator #constraints #multi #optimisation #problem
- Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows (DRK, SAP), pp. 18–25.
- STOC-1993-KleinPR #composition #multi #network
- Excluded minors, network decomposition, and multicommodity flow (PNK, SAP, SR), pp. 682–690.
- STOC-1993-PlotkinT #bound #multi
- Improved bounds on the max-flow min-cut ratio for multicommodity flows (SAP, ÉT), pp. 691–697.
- DAC-1991-CardenC #algorithm #approximate #multi #performance #using
- A Global Router Using An Efficient Approximate Multicommodity Multiterminal Flow Algorithm (RCCI, CKC), pp. 316–321.
- STOC-1991-LeightonMPSTT #algorithm #approximate #multi #performance #problem
- Fast Approximation Algorithms for Multicommodity Flow Problems (FTL, FM, SAP, CS, ÉT, ST), pp. 101–111.
- STOC-1986-KapoorV #algorithm #multi #performance #polynomial #programming
- Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows (SK, PMV), pp. 147–159.
- STOC-1985-SuzukiNS #graph #multi
- Multicommodity Flows in Planar Undirected Graphs and Shortest Paths (HS, TN, NS), pp. 195–204.