(Enter summary)
Abstract: We study the problem of estimating the average degree of a graph by sampling the degrees of some of its vertices. We show the following threshold behavior: approximation factors above 2 require far less samples than approximation factors below 2. This may be significant for algorithms that quickly try to estimate the load in communication networks. In oru proof we make use of... (Update)
Cited by: More
On the Sum of Nonnegative Independent - Random Variables With
(Correct)
Active bibliography (related documents): More All
0.0: Genomics via Optical Mapping (I): - Laws For Single
(Correct)
0.0: Ramsey Theory Applications - Rosta (2004)
(Correct)
0.0: A New Algorithmic Approach to the General Lovász Local.. - Czumaj, al.
(Correct)
Similar documents based on text: More All
0.3: Short Random Walks On Graphs - Barnes, Feige (1993)
(Correct)
0.3: The Weizmann Workshop on Probabilistic Proof Systems - Feige, (Eds.) (1994)
(Correct)
0.3: Approximating the Domatic Number - Feige, Halldórsson, Kortsarz (2000)
(Correct)
BibTeX entry: (Update)
U. Feige. "Sampling vertex degrees and estimating network load parameters." Manuscript, 2003 http://citeseer.ist.psu.edu/feige03sampling.html More
@misc{ feige03sampling,
author = "U. Feige",
title = "Sampling vertex degrees and estimating network load parameters",
year = "2003",
url = "citeseer.ist.psu.edu/feige03sampling.html" }
Citations (may not include all citations):
957
The Probabilistic Method (context) - Alon, Spencer - 2000
1
Who's the weakest link (context) - Devanur, Lipton et al. - 2003
Documents on the same site (http://www.wisdom.weizmann.ac.il/~feige/otherpapers.html): More
On the Sum of Nonnegative Independent - Random Variables With
(Correct)
On The Hardness Of Computing - The Permanent Of
(Correct)
Making Games Short (Extended Abstract) - Feige, Kilian
(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