Travelled to:1 × Germany
5 × USA
Collaborated with:D.R.Karger P.N.Klein É.Tardos C.A.Phillips J.Wein E.Torng M.Thorup N.E.Young S.Chakrabarti A.S.Schulz D.B.Shmoys F.T.Leighton F.Makedon S.A.Plotkin S.Tragoudas
Talks about:algorithm (5) approxim (2) schedul (2) minimum (2) flow (2) cut (2) multicommod (1) multiway (1) leighton (1) criteria (1)
Person: Clifford Stein
DBLP: Stein:Clifford
Contributed to:
19991997
1996199319911990Wrote 6 papers:
- STOC-1999-KargerKSTY #algorithm #geometry #multi
- Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut (DRK, PNK, CS, MT, NEY), pp. 668–678.
- STOC-1997-PhillipsSTW #scheduling
- Optimal Time-Critical Scheduling via Resource Augmentation (CAP, CS, ET, JW), pp. 140–149.
- ICALP-1996-ChakrabartiPSSSW #algorithm #scheduling
- Improved Scheduling Algorithms for Minsum Criteria (SC, CAP, ASS, DBS, CS, JW), pp. 646–657.
- STOC-1993-KargerS #algorithm
- An O~(n2) algorithm for minimum cuts (DRK, CS), pp. 757–765.
- 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-1990-KleinST #algorithm #approximate #concurrent #performance
- Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities (PNK, CS, ÉT), pp. 310–321.