Sudipto Guha, Adam Meyerson, Kamesh Munagala  Home/Search
Context Related
| stanford.edu/~kamesh/multilevel.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: stanford.edu/~kamesh/pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we give the first constant-approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where caches are placed in layers and each layer satisfies a fixed percentage of the demand (bounded miss rates). We present a constant approximation to the minimum total cost of placing the caches and routing demand through the layers. We extend this model to cover more general layered caching scenarios, giving a constant combinatorial... (Update)
Cited by: More
On the Optimization of Storage Capacity Allocation .. - Laoutaris.. (2003) (Correct)
Approximation Algorithms for Facility Location Problems - Jens Vygen (2005) (Correct)
Similar documents (at the sentence level):
75.4%: Hierarchical Placement and Network Design Problems - Guha, Meyerson, Munagala (2000) (Correct)
54.7%: Approximation Algorithms for Concave Cost Network Flow Problems - Munagala (2003) (Correct)
Active bibliography (related documents): More All
0.7: COST-DISTANCE: Two Metric Network Design - Meyerson, Munagala, Plotkin (2000) (Correct)
0.2: Designing Networks Incrementally - Meyerson, Munagala, Plotkin (2001) (Correct)
0.2: A Constant Factor Approximation for the Single Sink Edge .. - Guha, Meyerson, Munagala (2000) (Correct)
Similar documents based on text: More All
0.9: On the Integrality Gap of Capacitated Facility Location - Abrams, Meyerson.. (Correct)
0.8: Facility Location with Interference - Abrams, Könemann, Meyerson.. (2001) (Correct)
0.6: Local Search Heuristics for k-median and Facility.. - Arya, Garg.. (2002) (Correct)
Related documents from co-citation: More All
20: Approximation algorithms for facility location problems - Shmoys, Tardos et al. - 1997
18: Building steiner trees with incomplete global knowledge (context) - Karger, Minkoff - 2000
17: Improved combinatorial algorithms for facility location and k- median problems - Charikar, Guha - 1999
BibTeX entry: (Update)
S. Guha, A. Meyerson, and K. Munagala. Hierarchical placement and network design problems. Proceedings of 41st IEEE FOCS, 2000. http://citeseer.ist.psu.edu/guha00hierarchical.html More
@inproceedings{ guha00hierarchical,
author = "Sudipto Guha and Adam Meyerson and Kamesh Munagala",
title = "Hierarchical Placement and Network Design Problems",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "603-612",
year = "2000",
url = "citeseer.ist.psu.edu/guha00hierarchical.html" }
Citations (may not include all citations):396 Web caching and zipf-like distributions: Evidence and implic.. - Breslau, Cao et al. - 1999
301 Improved combinatorial algorithms for facility location and .. - Charikar, Guha - 1999
270 level uncapacitated facility location problem (context) - Aardal, Chudak et al. - 1999
266 Greedy strikes back: Improved facility location algorithms - Guha, Khuller - 1998
151 Probabilistic approximation of metric spaces and its algorit.. - Bartal - 1996
148 Approximation algorithms for facility location problems - Shmoys, Tardos et al. - 1997
93 On approximating arbitrary metrics by tree metrics - Bartal - 1998
86 Primal-dual approximation algorithms for metric facility loc.. - Jain, Vazirani - 1999
65 A generalized interval caching policy for mixed interactive .. - Dan, Sitaram - 1996
50 approximations with minimum packing constraint violations (context) - Lin, Vitter - 1992
46 Balancing minimum spanning and shortest path trees (context) - Khuller, Raghavachari et al. - 1994
45 Cost-sensitive analysis of communication protocols (context) - Awerbuch, Baratz et al. - 1990
44 Rounding via trees: Deterministic approximation algorithms f.. - Charikar, Chekuri et al. - 1998
27 Buy-at-bulk network design: Approximating the single-sink ed.. (context) - Salman, Cheriyan et al. - 1997
23 COSTDISTANCE: Two metric network design - Meyerson, Munagala et al.
22 Approximating a finite metric by a small number of tree metr.. - Charikar, Chekuri et al. - 1998
20 the two-level uncapacitated facility location problem - Aardal, Labbe et al. - 1996
19 Static caching of web servers - Tatarinov, Rousskov et al. - 1997
18 th IEEE Symposium on Foundations of Computer Science (context) - Andrews, Zhang et al. - 1998
17 th IEEE Symposium on Foundations of Computer Science (context) - Awerbuch, Azar et al. - 1997
14 A branch-and-bound algorithm for the multi-level uncapacitat.. (context) - Tcha, Lee - 1984
9 A dual based procedure for dynamic facility location (context) - Van Roy, Erlenkotter - 1982
8 Web caching framework: Analytical models and beyond - Zhang, Izmailov et al. - 1999
7 Placement of replicated items in distributed databases (context) - Milo, Wolfson - 1988
6 Online algorithms for caching multimedia streams - Andrews, Munagala - 2000
5 Operations Research Quarterly (context) - Kaufman, Eede et al. - 1977
3 Caching neighbourhood protocol: A foundation for building dy.. (context) - Chiang, Liu et al. - 1999
2 National Laboratory for Advanced Network Research (context) - Wessels, squid - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://theory.stanford.edu/~kamesh/pub.htm): More
Web Caching using Access Statistics - Meyerson, Munagala, Plotkin (2001) (Correct)
Extending Greedy Multicast Routing to Delay Sensitive.. - Goel, Munagala (1999) (Correct)
Online Algorithms for Caching Multimedia Streams - Andrews, Munagala (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC