Travelled to:6 × USA
Collaborated with:É.Tardos A.Goel D.R.Karger A.Meyerson P.N.Klein S.Rao A.V.Goldberg G.E.Shannon M.R.Henzinger J.Aspnes Y.Azar A.Fiat O.Waarts F.T.Leighton F.Makedon C.Stein S.Tragoudas
Talks about:flow (5) multicommod (4) schedul (3) problem (3) network (2) multipl (2) applic (2) rout (2) combinatori (1) throughput (1)
Person: Serge A. Plotkin
DBLP: Plotkin:Serge_A=
Contributed to:
200019991995199319911987Wrote 8 papers:
- STOC-2000-GoelMP #multi #online #throughput
- Combining fairness with throughput: online routing with multiple objectives (AG, AM, SAP), pp. 670–679.
- STOC-1999-GoelHPT #data transfer #network #problem #scheduling #set
- Scheduling Data Transfers in a Network and the Set Scheduling Problem (AG, MRH, SAP, ÉT), pp. 189–197.
- 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-AspnesAFPW #online #scheduling
- On-line load balancing with applications to machine scheduling and virtual circuit routing (JA, YA, AF, SAP, OW), pp. 623–631.
- 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.
- 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-1987-GoldbergPS #graph #parallel #symmetry
- Parallel Symmetry-Breaking in Sparse Graphs (AVG, SAP, GES), pp. 315–324.