Welcome to D
SIGMOD 2004
PODS 2004
SIGMOD RECOR
CIKM 2004
DASFAA 2004
DBPL 2003
DE-BULLETIN
DEBS 2004
DMKD 2004
DMSN 2004
DOLAP 2004
DPDJ 2004
EDBT 2004
ER 2003
GIS 2004
HDP 2004
HYPERTEXT 20
ICDE 2004
ICDT 2003
JCDL 2004
MDM
MIR 2004
MIS 2004
MMDB 2004
MOBIDE 2003
RIDE 2004
SBBD 2003
SIGIR FORUM
SIGIR 2004
SIGKDD EXPLO
SIGKDD 2004
SSDBM 2004
SSTD 2003
TIME 2004
TODS 2004
VLDB 2004
VLDB Journal
WEBDB 2004
WIDM 2004
XIME-P 2004
Footer

Adam Meyerson

Papers on DiSC'04


On the Complexity of Optimal K-Anonymity

Publications


Note: Links lead to the DBLP on the Web.

Adam Meyerson

Konstantin Andreev , Charles Garrod , Bruce M. Maggs , Adam Meyerson: Simultaneous Source Location. APPROX-RANDOM 2004 : 13-26

Adam Meyerson, Ryan Williams : On the Complexity of Optimal K-Anonymity. PODS 2004 : 223-228

Adam Meyerson: Online algorithms for network design. SPAA 2004 : 275-280

Nikhil Bansal , Avrim Blum , Shuchi Chawla , Adam Meyerson: Approximation algorithms for deadline-TSP and vehicle routing with time-windows. STOC 2004 : 166-174

Adam Meyerson, Liadan O'Callaghan , Serge A. Plotkin : A k -Median Algorithm with Running Time Independent of Data Size. Machine Learning 56 (1-3): 61-87 (2004)

Vijay Arya , Naveen Garg , Rohit Khandekar , Adam Meyerson, Kamesh Munagala , Vinayaka Pandit : Local Search Heuristics for k-Median and Facility Location Problems. SIAM J. Comput. 33 (3): 544-562 (2004)

Avrim Blum , Shuchi Chawla , David R. Karger , Terran Lane , Adam Meyerson, Maria Minkoff : Approximation Algorithms for Orienteering and Discounted-Reward TSP. FOCS 2003 : 46-55

Konstantin Andreev , Bruce M. Maggs , Adam Meyerson, Ramesh K. Sitaraman : Designing overlay multicast networks for streaming. SPAA 2003 : 149-158

Nikhil Bansal , Avrim Blum , Shuchi Chawla , Adam Meyerson: Online oblivious routing. SPAA 2003 : 44-49

Tomás Feder , Adam Meyerson, Rajeev Motwani , Liadan O'Callaghan , Rina Panigrahy : Representing Graph Metrics with Fewest Edges. STACS 2003 : 355-366

Baruch Awerbuch , Yossi Azar , Adam Meyerson: Reducing truth-telling online mechanisms to online optimization. STOC 2003 : 503-510

Sudipto Guha , Adam Meyerson, Nina Mishra , Rajeev Motwani , Liadan O'Callaghan : Clustering Data Streams: Theory and Practice. IEEE Trans. Knowl. Data Eng. 15 (3): 515-528 (2003)

Sudipto Guha , Adam Meyerson, Kamesh Munagala : A constant factor approximation algorithm for the fault-tolerant facility location problem. J. Algorithms 48 (2): 429-440 (2003)

Liadan O'Callaghan , Adam Meyerson, Rajeev Motwani , Nina Mishra , Sudipto Guha : Streaming-Data Algorithms for High-Quality Clustering. ICDE 2002 : 685-

Adam Meyerson, Kamesh Munagala , Serge A. Plotkin : Designing Networks Incrementally. FOCS 2001 : 406-415

Adam Meyerson: Online Facility Location. FOCS 2001 : 426-431

Rishi Bhargava , Ashish Goel , Adam Meyerson: Using approximate majorization to characterize protocol fairness. SIGMETRICS/Performance 2001 : 330-331

Adam Meyerson, Kamesh Munagala , Serge A. Plotkin : Web caching using access statistics. SODA 2001 : 354-363

Ashish Goel , Adam Meyerson, Serge A. Plotkin : Approximate majorization and fair online load balancing. SODA 2001 : 384-390

Ashish Goel , Adam Meyerson, Serge A. Plotkin : Distributed admission control, scheduling, and routing with stale information. SODA 2001 : 611-619

Sudipto Guha , Adam Meyerson, Kamesh Munagala : Improved algorithms for fault tolerant facility location. SODA 2001 : 636-641

Adam Meyerson: Profit-earning facility location. STOC 2001 : 30-36

Sudipto Guha , Adam Meyerson, Kamesh Munagala : A constant factor approximation for the single sink edge installation problems. STOC 2001 : 383-388

Ashish Goel , Adam Meyerson, Serge A. Plotkin : Combining Fairness with Throughput: Online Routing with Multiple Objectives. J. Comput. Syst. Sci. 63 (1): 62-79 (2001)

Sudipto Guha , Adam Meyerson, Kamesh Munagala : Hierarchical Placement and Network Design Problems. FOCS 2000 : 603-612

Adam Meyerson, Kamesh Munagala , Serge A. Plotkin : Cost-Distance: Two Metric Network Design. FOCS 2000 : 624-630

Ashish Goel , Adam Meyerson, Serge A. Plotkin : Combining fairness with throughput: online routing with multiple objectives. STOC 2000 : 670-679

1 [ 20 ] [ 27 ]

2 [ 22 ]

3 [ 17 ]

4 [ 17 ]

5 [ 19 ] [ 24 ]

6 [ 11 ]

7 [ 19 ] [ 21 ] [ 24 ]

8 [ 19 ] [ 21 ] [ 24 ]

9 [ 18 ]

10 [ 22 ]

11 [ 27 ]

12 [ 1 ] [ 4 ] [ 8 ] [ 9 ] [ 11 ]

13 [ 3 ] [ 5 ] [ 7 ] [ 14 ] [ 15 ] [ 16 ]

14 [ 21 ]

15 [ 22 ]

16 [ 21 ]

17 [ 20 ] [ 27 ]

18 [ 21 ]

19 [ 14 ] [ 16 ]

20 [ 14 ] [ 16 ] [ 18 ]

21 [ 2 ] [ 3 ] [ 5 ] [ 7 ] [ 10 ] [ 13 ] [ 15 ] [ 22 ]

22 [ 14 ] [ 16 ] [ 18 ] [ 23 ]

23 [ 22 ]

24 [ 18 ]

25 [ 1 ] [ 2 ] [ 4 ] [ 8 ] [ 9 ] [ 10 ] [ 13 ] [ 23 ]

26 [ 20 ]

27 [ 26 ]




©2005 Association for Computing Machinery