skip to content

Karger, David R.

Overview
Works: 10 works in 15 publications in 1 language and 60 library holdings
Genres: Conference proceedings 
Roles: Other
Classifications: TK5105.88815, 025.0427
Publication Timeline
Key
Publications about David R Karger
Publications by David R Karger
Most widely held works by David R Karger
The semantic web ISWC 2008 : 7th International Semantic Web Conference, ISWC 2008, Karlsruhe, Germany, October 26-30, 2008 : proceedings by Abraham Bernstein( file )
6 editions published in 2009 in English and held by 51 libraries worldwide
Annotation
A better algorithm for an ancient scheduling problem by David R Karger( Article )
1 edition published in 1994 in English and held by 1 library worldwide
Random sampling in graph optimization problems by David R Karger( Book )
1 edition published in 1994 in English and held by 1 library worldwide
Augmentin undirected edge connectivity in O(n2) time by András A Benczúr( Article )
1 edition published in 1998 in English and held by 1 library worldwide
Using randomized sparsification to approximate minimum cuts by David R Karger( Article )
1 edition published in 1994 in English and held by 1 library worldwide
Inplementing fully polynomial time approximation scheme for all terminal network reliability by David R Karger( Article )
1 edition published in 1997 in English and held by 1 library worldwide
Batter random sampling algorithms for flows in undirected graphs by David R Karger( Article )
1 edition published in 1998 in English and held by 1 library worldwide
Global min-cuts in RNC, and the other ramifications of a simple min-cut algorithm by David R Karger( Article )
1 edition published in 1993 in English and held by 1 library worldwide
A new approach to the minimum cut problem by David R Karger( Book )
1 edition published in 1994 in English and held by 1 library worldwide
Random sampling in graph optimization problems by Stanford University( Book )
1 edition published in 1995 in English and held by 1 library worldwide
The representative random sample is a central concept of statistics. It is often possible to gather a great deal of information about a large population by examining a small sample randomly drawn from it. This approach has obvious advantages in reducing the investigator's work, both in gathering and in analyzing the data. We apply the concept of a representative sample to combinatorial optimization. Our focus is optimization problems on undirected graphs. Highlights of our results include: The first (randomized) linear time minimum spanning tree algorithm; A (randomized) minimum cut algorithm with running time roughly O(n[superscript]2) as compared to previous roughly O(n[superscript]3) time bounds, as well as the first algorithm for finding all approximately minimal cuts and multiway cuts; An efficient parallelization of the minimum cut algorithm, providing the first parallel (RNC) algorithm for minimum cuts; A derandomization finding minimum cut in NC; Provably accurate approximations to network reliability; Very fast approximation algorithms for minimum cuts, s-t minimum cuts, and maximum flows; Significantly improved polynomial-time approximation bounds for network design problems; For coloring 3-colorable graphs, improvements in the approximation bounds from O(n[superscript]{3/8}) to O(n[superscript]{1/4}); An analysis of random sampling in Matroids
 
Languages
English (15)
Covers
Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.