Nikhil Devanur, Richard J. Lipton, and Nisheeth Vishnoi...  Home/Search
Context
Related
| gatech.edu/~nikhil/pub...sagafinal.pdf 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: gatech.edu/~nikhil/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we consider the following problem: Given a network G, determine if there is an edge in G through which at least c shortest paths pass. This problem arises naturally in various practical situations where there is a massive network (telephone, internet), and routing of data is done via shortest paths and one wants to identify most congested edges in the network. (Update)
Active bibliography (related documents): More All
0.3: The Ruin Problem And Cover Times Of Asymetric Random.. - Chong Chinese University (1999) (Correct)
0.3: Randomized Algorithms - Goemans (1994) (Correct)
0.3: A Decade of Combinatorial Optimization - Aardal, van Hoesel, Lenstra.. (1997) (Correct)
Similar documents based on text: More All
0.6: A Local-Global Principle for Diophantine Equations (Extended.. - Lipton, Vishnoi (2003) (Correct)
0.2: The Complexity of the A B C Problem Resolved - Cai, Lipton, Zalcstein (Correct)
0.2: A Generalization of the Characteristic Polynomial of a Graph - Richard Lipton Nisheeth (2003) (Correct)
BibTeX entry: (Update)
@misc{ richard-whos,
author = "Nikhil Devanur Richard",
title = "Who's The Weakest Link?",
url = "citeseer.ist.psu.edu/621596.html" }
Citations (may not include all citations):957 The Probabilistic Method (context) - Alon, Spencer - 2000
837 Cambridge University Press (context) - Motwani, Raghavan et al. - 1995
310 A note on two problems in connection with graphs (context) - Dijkstra - 1976
132 the evolution of random graph (context) - Erdos, Renyi - 1960
91 Approximation Algorithms (context) - Vazirani - 2001
86 A theorem on Boolean matrices (context) - Warshall - 1962
68 Monte Carlo approximation algorithms for enumeration problem.. (context) - Karp, Luby et al. - 1989
55 Cambridge University Press (context) - Bollobas, Graphs - 2001
49 Algorithm 97: Shortest Path (context) - Floyd - 1962
47 Urn Models and Their Applications (context) - Johnson, Kotz - 1977
33 An Introduction Through Randomized Algorithms (context) - Mulmuley, Geometry - 1994
10 Monte Carlo algorithms for the planar multi-terminal network.. (context) - Karp, Luby - 1985
6 Better Random Sampling Algorithms for Flows in Undirected Gr.. - Karger - 1998
5 cient algorithms for shortest paths in sparse networks (context) - Johnson - 1977
3 A random polynomial algorithm for approximating the volume o.. (context) - Dyer, Frieze et al. - 1991
3 Problems and Snapshots from the World of Probability (context) - Blom, Holst et al. - 1994
1 Random sampling in residual graphs (context) - Karger, Levine - 2002
Documents on the same site (http://www.cc.gatech.edu/~nikhil/index.html):
Market Equilibrium via a Primal-Dual-Type Algorithm - Devanur, Papadimitriou.. (2002) (Correct)
Strategyproof Cost-sharing Mechanisms for Set Cover and.. - Devanur, Mihail.. (2003) (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