skip to content
Derandomization through approximation : an NC algorithm for minimum cuts Preview this item
ClosePreview this item
Checking...

Derandomization through approximation : an NC algorithm for minimum cuts

Author: David Karger; Rajeev Motwani; Stanford University. Computer Science Department.
Publisher: Stanford, Calif. : Stanford University, Dept. of Computer Science, [1993]
Series: Report (Stanford University. Computer Science Department), no. STAN- CS-93-1471.
Edition/Format:   Print book : EnglishView all editions and formats
Database:WorldCat
Summary:
Abstract: "We prove that the minimum cut problem can be solved in NC on arbitrarily weighted undirected graphs. We do so by giving three separate and independently interesting results. The first is a relatively straightforward NC (2 + [epsilon])-approximation algorithm for the minimum cut. It uses O(m²/n) processors. The second result is a randomized reduction of the minimum cut problem to the minimum cut  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: David Karger; Rajeev Motwani; Stanford University. Computer Science Department.
OCLC Number: 30498431
Notes: "May 4, 1993."
Description: 18 pages ; 28 cm.
Series Title: Report (Stanford University. Computer Science Department), no. STAN- CS-93-1471.
Responsibility: David R. Karger, Rajeev Motwani.

Abstract:

Abstract: "We prove that the minimum cut problem can be solved in NC on arbitrarily weighted undirected graphs. We do so by giving three separate and independently interesting results. The first is a relatively straightforward NC (2 + [epsilon])-approximation algorithm for the minimum cut. It uses O(m²/n) processors. The second result is a randomized reduction of the minimum cut problem to the minimum cut approximation problem. The third is a derandomization of this reduction. Performing the derandomization requires a novel combination of two previously known derandomization techniques: pairwise independence and random walks on expanders."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/30498431> # Derandomization through approximation : an NC algorithm for minimum cuts
    a schema:CreativeWork, schema:Book ;
    library:oclcnum "30498431" ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/476638698#Place/stanford_calif> ; # Stanford, Calif.
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/cau> ;
    schema:about <http://id.worldcat.org/fast/1089818> ; # Random walks (Mathematics)
    schema:bookFormat bgn:PrintBook ;
    schema:contributor <http://viaf.org/viaf/27998371> ; # Rajeev Motwani
    schema:contributor <http://viaf.org/viaf/152491517> ; # Stanford University. Computer Science Department.
    schema:creator <http://experiment.worldcat.org/entity/work/data/476638698#Person/karger_david> ; # David Karger
    schema:datePublished "1993" ;
    schema:description "Abstract: "We prove that the minimum cut problem can be solved in NC on arbitrarily weighted undirected graphs. We do so by giving three separate and independently interesting results. The first is a relatively straightforward NC (2 + [epsilon])-approximation algorithm for the minimum cut. It uses O(m²/n) processors. The second result is a randomized reduction of the minimum cut problem to the minimum cut approximation problem. The third is a derandomization of this reduction. Performing the derandomization requires a novel combination of two previously known derandomization techniques: pairwise independence and random walks on expanders.""@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/476638698> ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/476638698#Series/report_stanford_university_computer_science_department> ; # Report (Stanford University. Computer Science Department) ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/476638698#Series/report_stanford_university_dept_of_computer_science> ; # Report / Stanford University. Dept. of Computer Science ;
    schema:name "Derandomization through approximation : an NC algorithm for minimum cuts"@en ;
    schema:productID "30498431" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/30498431#PublicationEvent/stanford_calif_stanford_university_dept_of_computer_science_1993> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/476638698#Agent/stanford_university_dept_of_computer_science> ; # Stanford University, Dept. of Computer Science
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/30498431> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/476638698#Agent/stanford_university_dept_of_computer_science> # Stanford University, Dept. of Computer Science
    a bgn:Agent ;
    schema:name "Stanford University, Dept. of Computer Science" ;
    .

<http://experiment.worldcat.org/entity/work/data/476638698#Person/karger_david> # David Karger
    a schema:Person ;
    schema:familyName "Karger" ;
    schema:givenName "David" ;
    schema:name "David Karger" ;
    .

<http://experiment.worldcat.org/entity/work/data/476638698#Place/stanford_calif> # Stanford, Calif.
    a schema:Place ;
    schema:name "Stanford, Calif." ;
    .

<http://experiment.worldcat.org/entity/work/data/476638698#Series/report_stanford_university_computer_science_department> # Report (Stanford University. Computer Science Department) ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/30498431> ; # Derandomization through approximation : an NC algorithm for minimum cuts
    schema:name "Report (Stanford University. Computer Science Department) ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/476638698#Series/report_stanford_university_dept_of_computer_science> # Report / Stanford University. Dept. of Computer Science ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/30498431> ; # Derandomization through approximation : an NC algorithm for minimum cuts
    schema:name "Report / Stanford University. Dept. of Computer Science ;" ;
    .

<http://id.worldcat.org/fast/1089818> # Random walks (Mathematics)
    a schema:Intangible ;
    schema:name "Random walks (Mathematics)"@en ;
    .

<http://viaf.org/viaf/152491517> # Stanford University. Computer Science Department.
    a schema:Organization ;
    schema:name "Stanford University. Computer Science Department." ;
    .

<http://viaf.org/viaf/27998371> # Rajeev Motwani
    a schema:Person ;
    schema:familyName "Motwani" ;
    schema:givenName "Rajeev" ;
    schema:name "Rajeev Motwani" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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