skip to content
Approximation algorithms Preview this item
ClosePreview this item
Checking...

Approximation algorithms

Author: Vijay V Vazirani
Publisher: Berlin ; New York : Springer, ©2003.
Edition/Format:   Print book : English : Corr. 2nd print
Rating:

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

Subjects
More like this

Find a copy online

Links to this item

Find a copy in the library

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

Details

Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: Vijay V Vazirani
ISBN: 9783540653677 3540653678
OCLC Number: 1007068066
Description: xix, 380 p. : ill. ; 25 cm.
Contents: Combinatorial algorithms --
Set cover --
Steiner tree and TSP --
Multiway cut and k-cut --
k-center --
Feedback vertex set --
Shortest superstring --
Knapsack --
Bin packing --
Minimum makespan scheduling --
Euclidean TSP --
LP-based algorithms --
Introduction to LP-Duality --
Set cover via dual fitting --
Rounding applied to set cover --
Set cover via the primal-dual schema --
Maximum satisfiability --
Scheduling on unrelated parallel machines --
Multicut and integer multicommodity flow in trees --
Multiway cut --
Multicut in general graphs --
Sparsest cut --
Steiner forest --
Steiner network --
Facility location --
k-median --
Semidefinite programming --
Other topics --
Shortest vector --
Counting problems --
Hardness of approximation --
Open problems --
An overview of complexity theory for the algorithm designer --
Basic facts from probability theory.
Responsibility: Vijay V. Vazirani.

Reviews

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

Tags

Be the first.

Similar Items

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/1007068066> # Approximation algorithms
    a schema:CreativeWork, schema:Book ;
    library:oclcnum "1007068066" ;
    library:placeOfPublication <http://dbpedia.org/resource/New_York_City> ; # New York
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/4551928861#Place/berlin> ; # Berlin
    schema:about <http://experiment.worldcat.org/entity/work/data/4551928861#Topic/mathematical_optimization> ; # Mathematical optimization
    schema:about <http://experiment.worldcat.org/entity/work/data/4551928861#Topic/computer_algorithms> ; # Computer algorithms
    schema:bookEdition "Corr. 2nd print." ;
    schema:bookFormat bgn:PrintBook ;
    schema:copyrightYear "2003" ;
    schema:creator <http://experiment.worldcat.org/entity/work/data/4551928861#Person/vazirani_vijay_v> ; # Vijay V. Vazirani
    schema:datePublished "2003" ;
    schema:description "Combinatorial algorithms -- Set cover -- Steiner tree and TSP -- Multiway cut and k-cut -- k-center -- Feedback vertex set -- Shortest superstring -- Knapsack -- Bin packing -- Minimum makespan scheduling -- Euclidean TSP -- LP-based algorithms -- Introduction to LP-Duality -- Set cover via dual fitting -- Rounding applied to set cover -- Set cover via the primal-dual schema -- Maximum satisfiability -- Scheduling on unrelated parallel machines -- Multicut and integer multicommodity flow in trees -- Multiway cut -- Multicut in general graphs -- Sparsest cut -- Steiner forest -- Steiner network -- Facility location -- k-median -- Semidefinite programming -- Other topics -- Shortest vector -- Counting problems -- Hardness of approximation -- Open problems -- An overview of complexity theory for the algorithm designer -- Basic facts from probability theory."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/4551928861> ;
    schema:inLanguage "en" ;
    schema:name "Approximation algorithms"@en ;
    schema:numberOfPages "380" ;
    schema:productID "1007068066" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/1007068066#PublicationEvent/berlin_new_york_springer_c2003> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/4551928861#Agent/springer> ; # Springer
    schema:url <http://swbplus.bsz-bw.de/bsz104072741cov.htm> ;
    schema:workExample <http://worldcat.org/isbn/9783540653677> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/1007068066> ;
    .


Related Entities

<http://dbpedia.org/resource/New_York_City> # New York
    a schema:Place ;
    schema:name "New York" ;
    .

<http://experiment.worldcat.org/entity/work/data/4551928861#Person/vazirani_vijay_v> # Vijay V. Vazirani
    a schema:Person ;
    schema:familyName "Vazirani" ;
    schema:givenName "Vijay V." ;
    schema:name "Vijay V. Vazirani" ;
    .

<http://experiment.worldcat.org/entity/work/data/4551928861#Topic/computer_algorithms> # Computer algorithms
    a schema:Intangible ;
    schema:name "Computer algorithms"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/4551928861#Topic/mathematical_optimization> # Mathematical optimization
    a schema:Intangible ;
    schema:name "Mathematical optimization"@en ;
    .

<http://worldcat.org/isbn/9783540653677>
    a schema:ProductModel ;
    schema:isbn "3540653678" ;
    schema:isbn "9783540653677" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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