Travelled to:1 × Canada
1 × France
1 × Greece
1 × Italy
3 × USA
Collaborated with:A.Goel R.Williams K.Munagala ∅ A.Cote L.J.Poplawski D.E.Carroll B.Awerbuch Y.Azar S.Guha S.A.Plotkin N.Bansal A.Blum S.Chawla V.Arya N.Garg R.Khandekar V.Pandit
Talks about:onlin (3) approxim (2) problem (2) optim (2) locat (2) facil (2) rout (2) throughput (1) bandwidth (1) algorithm (1)
Person: Adam Meyerson
DBLP: Meyerson:Adam
Contributed to:
2008
2006
20042004200320012000Wrote 9 papers:
- STOC-2008-CoteMP #random
- Randomized k-server on hierarchical binary trees (AC, AM, LJP), pp. 227–234.
- ICALP-v1-2006-CarrollGM #bound #graph
- Embedding Bounded Bandwidth Graphs into l1 (DEC, AG, AM), pp. 27–37.
- PODS-2004-MeyersonW #complexity #on the
- On the Complexity of Optimal K-Anonymity (AM, RW), pp. 223–228.
- STOC-2004-BansalBCM #algorithm #approximate
- Approximation algorithms for deadline-TSP and vehicle routing with time-windows (NB, AB, SC, AM), pp. 166–174.
- STOC-2003-AwerbuchAM #online #optimisation
- Reducing truth-telling online mechanisms to online optimization (BA, YA, AM), pp. 503–510.
- STOC-2001-AryaGKMP #heuristic #problem
- Local search heuristic for k-median and facility location problems (VA, NG, RK, AM, KM, VP), pp. 21–29.
- STOC-2001-GuhaMM #approximate #constant #problem
- A constant factor approximation for the single sink edge installation problems (SG, AM, KM), pp. 383–388.
- STOC-2001-Meyerson
- Profit-earning facility location (AM), pp. 30–36.
- STOC-2000-GoelMP #multi #online #throughput
- Combining fairness with throughput: online routing with multiple objectives (AG, AM, SAP), pp. 670–679.