Kamesh Munagala  Home/Search
Context
Related
| stanford.edu/~kamesh/thesis.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/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The cost structures for resource allocation in many network design problems obey economies of scale, meaning that the cost per unit resource becomes cheaper as the amount of resources allocated increases. For instance, if we are purchasing cables to route data in a network, the cost per unit bandwidth reduces as the bandwidth we need to route increases. Another feature of resource allocation is granularity, meaning that the resource can only be purchased in multiples of a certain minimum... (Update)
Similar documents (at the sentence level): More
22.1%: Hierarchical Placement and Network Design Problems - Guha, Meyerson, Munagala (2000) (Correct)
8.9%: Cost-Distance: Two Metric Network Design - Meyerson, Munagala, Plotkin (2000) (Correct)
7.6%: COST-DISTANCE: Two Metric Network Design - Meyerson, Munagala, Plotkin (2000) (Correct)
Active bibliography (related documents): More All
7.5: Approximation Algorithms for Facility Location Problems - Jens Vygen (2005) (Correct)
0.7: Online Algorithms for Network Design - Meyerson (2003) (Correct)
0.6: Approximation via Cost-Sharing: A Simple.. - Gupta, Kumar, Pal.. (2003) (Correct)
Similar documents based on text: More All
0.2: Better Streaming Algorithms for Clustering Problems - Charikar, O'Callaghan.. (2003) (Correct)
0.2: Further Improvements in Competitive Guarantees for.. - Bansal, Fleischer.. (Correct)
0.2: Switch Scheduling via Randomized Edge Coloring - Rajeev (Correct)
BibTeX entry: (Update)
@misc{ munagala-approximation,
author = "Kamesh Munagala",
title = "Approximation Algorithms for Concave Cost Network Flow Problems",
url = "citeseer.ist.psu.edu/munagala03approximation.html" }
Citations (may not include all citations):482 Combinatorial Optimization: Algorithms and Complexity (context) - Papadimitriou, Steiglitz - 1998
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
271 Improved approximation algorithms for uncapacitated facility.. - Chudak - 1998
270 level uncapacitated facility location problem (context) - Aardal, Chudak et al. - 1999
266 Greedy strikes back: Improved facility location algorithms - Guha, Khuller - 1998
227 The uncapacitated facility location problem (context) - Cornuejols, Nemhauser et al. - 1990
217 Analysis of a local search heuristic for facility location p.. - Korupolu, Plaxton et al. - 1998
206 A deterministic algorithm for the Cost-Distance problem - Chekuri, Khanna et al. - 2001
194 Hierarchical placement and network design problems - Guha, Meyerson et al. - 2000
165 A heuristic program for locating warehouses (context) - Kuehn, Hamburger - 1963
163 A fast algorithm for steiner trees (context) - Kou, Markowsky et al. - 1981
160 A general approximation technique for constrained forest pro.. - Goemans, Williamson - 1995
151 Probabilistic approximation of metric spaces and its algorit.. - Bartal - 1996
148 Approximation algorithms for facility location problems - Shmoys, Tardos et al. - 1997
132 Improved approximation algorithms for metric facility locati.. - Mahdian, Ye et al. - 2001
130 Multicast routing for multimedia communication - Kompella, Pasquale et al. - 1993
93 On approximating arbitrary metrics by tree metrics - Bartal - 1998
86 Primal-dual approximation algorithms for metric facility loc.. - Jain, Vazirani - 1999
80 the placement of Internet instrumentation - Jamin, Jin et al. - 2000
75 Dynamic steiner tree problem (context) - Imaze, Waxman - 1991
74 the placement of web server replicas - Qiu, Padmanabham et al. - 2001
70 the optimal placement of web proxies in the internet (context) - Li, Golin et al. - 1999
65 A generalized interval caching policy for mixed interactive .. - Dan, Sitaram - 1996
61 How bad is naive multicast routing - Doar, Leslie - 1992
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
39 A new greedy approach for facility location problems - Jain, Mahdian et al. - 2002
38 Local search heuristics for the k-median and facility locati.. - Arya, Garg et al. - 2001
36 Buy-at-bulk network design - Awerbuch, Azar - 1997
27 Buy-at-bulk network design: Approximating the single-sink ed.. (context) - Salman, Cheriyan et al. - 1997
26 Building steiner trees with incomplete global knowledge (context) - Karger, Minko - 2000
25 line steiner trees in the euclidean plane - Alon, Azar - 1993
24 Provisioning a virtual private network: A network design pro.. - Gupta, Kleinberg et al. - 2001
23 Cost-Distance: Two metric network design - Meyerson, Munagala et al. - 2000
20 the two-level uncapacitated facility location problem - Aardal, Labb et al. - 1996
19 Static caching of web servers - Tatarinov, Rousskov et al. - 1997
17 The access network design problem - Andrews, Zhang - 1998
17 Approximating a nite metric by a small number of tree metric.. (context) - Charikar, Chekuri et al. - 1998
16 A best possible approximation algorithm for the k-center pro.. (context) - Hochbaum, Shmoys - 1985
15 An iterative algorithm for delay-constrained minimum-cost mu.. - Parsa, Zhu et al. - 1998
14 A branch-and-bound algorithm for the multi-level uncapacitat.. (context) - Tcha, Lee - 1984
14 Approximating shallow-light trees (context) - Kortsarz, Peleg - 1997
14 Approximating min-sum k- clustering in metric spaces (context) - Bartal, Charikar et al. - 2001
13 Routing to multiple destinations in computer networks (context) - Bharath-Kumar, Ja - 1983
10 of multicast trees and algorithms (context) - Wei, Estrin - 1994
9 the integrality gap of a natural formulation of the singlesi.. - Garg, Khandekar et al. - 2001
9 A dual based procedure for dynamic facility location (context) - Van Roy, Erlenkotter - 1982
9 Improved algorithms for fault tolerant facility location - Guha, Meyerson et al. - 2001
8 A constant factor approximation algorithm for the multicommo.. - Gupta, Kumar et al. - 2002
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
6 the uncapacitated location problem (context) - Cornuejols, Fisher et al. - 1977
5 Designing networks incrementally - Meyerson, Munagala et al. - 2001
5 Facility location with non-uniform hard capacities (context) - al, Tardos et al. - 2001
5 Operations Research Quarterly (context) - Kaufman, Eede et al. - 1977
4 Computing Research Repository: Computational Complexity (context) - Marathe, Ravi et al. - 1998
3 Caching neighbourhood protocol: A foundation for building dy.. (context) - Chiang, Liu et al. - 1999
3 Integrated logistics: Approximation algorithms combining fac.. (context) - Ravi, Sinha - 2002
3 Con guring hierarchical squid caches (context) - Wessels - 1997
3 Fast approximation algorithms for the fractional Steiner for.. - Garg, Khandekar - 2002
3 Improved algorithms for the data placement problem - Guha, Munagala - 2002
2 Balancing Steiner trees and shortest path trees online (context) - Goel, Munagala - 2000
2 An ecient multicast routing algorithm for delay-sensitive ap.. (context) - Hong, Lee et al. - 1998
2 Analysis of a ow problem with xed charges (context) - Hochbaum, Segev - 1989
1 A branch-and-cut algorithm for the uncapacitated xed charge .. (context) - Ortega, Wolsey - 2000
1 Tailoring Bender's decomposition for uncapacitated network d.. (context) - Magnanti, Mireault et al. - 1986
1 A constant factor approximation to the single-sink edge inst.. (context) - Guha, Meyerson et al. - 2001
1 Generalized clustering problems (context) - Guha, Munagala - 2002
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