skip to content

Karger, David R.

Overview
Works: 14 works in 18 publications in 1 language and 65 library holdings
Genres: Conference papers and proceedings 
Roles: Author, Editor
Classifications: QA76.76.A65, 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 International Semantic Web Conference( file )
5 editions published in 2009 in English and held by 45 libraries worldwide
This book constitutes the refereed proceedings of the 7th International Semantic Web Conference, ISWC 2008, held in Karlsruhe, Germany, during October 26-30, 2008. The volume contains 43 revised full research papers selected from a total of 261 submissions, of which an additional 3 papers were referred to the semantic Web in-use track; 11 papers out of 26 submissions to the semantic Web in-use track, and 7 papers and 12 posters accepted out of 39 submissions to the doctorial consortium. The topics covered in the research track are ontology engineering; data management; software and service engineering; non-standard reasoning with ontologies; semantic retrieval; OWL; ontology alignment; description logics; user interfaces; Web data and knowledge; semantic Web services; semantic social networks; and rules and relatedness. The semantic Web in-use track covers knowledge management; business applications; applications from home to space; and services and infrastructure
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
Looking up data in P2P systems by Hari Balakrishnan( Article )
1 edition published in 2003 in English and held by 1 library worldwide
Random sampling in cut, flow, and network design problems p383-413 by David R Karger( Article )
1 edition published in 1999 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
Rounding algorithms for genetics embedding of minimum multiway cut by David R Karger( Article )
1 edition published in 2004 in English and held by 1 library worldwide
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
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
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
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
Random sampling in graph optimization problems by David Karger( Archival Material )
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
The Semantic Web - ISWC 2009 8th International Semantic Web Conference, ISWC 2009, Chantilly, VA, USA, October 25-29, 2009. Proceedings by Abraham Bernstein( file )
1 edition published in 2009 in Undetermined and held by 0 libraries worldwide
This book constitutes the refereed proceedings of the 8th International Semantic Web Conference, ISWC 2009, held in Chantilly, VA, USA, during October 25-29, 2009. The volume contains 43 revised full research papers selected from a total of 250 submissions; 15 papers out of 59 submissions to the semantic Web in-use track, and 7 papers and 12 posters accepted out of 19 submissions to the doctorial consortium. The topics covered in the research track are ontology engineering; data management; software and service engineering; non-standard reasoning with ontologies; semantic retrieval; OWL; ontology alignment; description logics; user interfaces; Web data and knowledge; semantic Web services; semantic social networks; and rules and relatedness. The semantic Web in-use track covers knowledge management; business applications; applications from home to space; and services and infrastructure
 
moreShow More Titles
fewerShow Fewer Titles
Languages
English (17)
Covers
Close Window

Please sign in to WorldCat 

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