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

Approximation algorithms

Author: Vijay V Vazirani
Publisher: Berlin ; New York : Springer, ©2001.
Edition/Format:   Print book : EnglishView all editions and formats
Summary:
"The challenge met by this book is to capture the beauty and excitement of work in this thriving field and to convey in a lucid manner the underlying theory and methodology. Many of the research results presented have been simplified, and new insights provided. Perhaps the most important aspect of the book is that it shows simple ways of talking about complex, powerful algorithmic ideas by giving intuitive proofs,
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: 3540653678 9783540653677 3642084699 9783642084690
OCLC Number: 47097680
Description: xix, 378 pages : illustrations ; 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.
More information:

Abstract:

Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement  Read more...

Reviews

Editorial reviews

Publisher Synopsis

From the reviews:"Approximation algorithms is an area where much progress has been made in the last 10 years. The book under review is a very good help for understanding these results. In each of the Read more...

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

Tags

Be the first.
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/47097680> # Approximation algorithms
    a schema:Book, schema:CreativeWork ;
    library:oclcnum "47097680" ;
    library:placeOfPublication <http://dbpedia.org/resource/New_York_City> ; # New York
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/1074724#Place/berlin> ; # Berlin
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/1074724#Topic/mathematische_programmering> ; # Mathematische programmering
    schema:about <http://experiment.worldcat.org/entity/work/data/1074724#Topic/approximation_theorie_de_l> ; # Approximation, Théorie de l'
    schema:about <http://id.worldcat.org/fast/872010> ; # Computer algorithms
    schema:about <http://experiment.worldcat.org/entity/work/data/1074724#Topic/algoritmen> ; # Algoritmen
    schema:about <http://dewey.info/class/005.1/e21/> ;
    schema:about <http://id.worldcat.org/fast/1012099> ; # Mathematical optimization
    schema:about <http://experiment.worldcat.org/entity/work/data/1074724#Topic/relaxatie> ; # Relaxatie
    schema:about <http://experiment.worldcat.org/entity/work/data/1074724#Topic/optimisation_mathematique> ; # Optimisation mathématique
    schema:about <http://experiment.worldcat.org/entity/work/data/1074724#Topic/algorithmes> ; # Algorithmes
    schema:about <http://experiment.worldcat.org/entity/work/data/1074724#Topic/benaderingen_wiskunde> ; # Benaderingen (wiskunde)
    schema:bookFormat bgn:PrintBook ;
    schema:copyrightYear "2001" ;
    schema:creator <http://viaf.org/viaf/300626> ; # Vijay V. Vazirani
    schema:datePublished "2001" ;
    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:description ""This book will be of interest to the scientific community at large and in particular, to students and researchers in Computer Science, Operations Research, and Discrete Mathematics. It can be used both as a text in a graduate course on approximation algorithms and as a supplementary text in basic undergraduate and graduate courses on algorithms."--Jacket."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/1074724> ;
    schema:inLanguage "en" ;
    schema:name "Approximation algorithms"@en ;
    schema:productID "47097680" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/47097680#PublicationEvent/berlin_new_york_springer_2001> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/1074724#Agent/springer> ; # Springer
    schema:reviews <http://www.worldcat.org/title/-/oclc/47097680#Review/1830919561> ;
    schema:url <http://swbplus.bsz-bw.de/bsz07520813xcov.htm> ;
    schema:url <http://www.gbv.de/dms/goettingen/330084615.pdf> ;
    schema:url <http://catdir.loc.gov/catdir/enhancements/fy0816/2001042005-t.html> ;
    schema:workExample <http://worldcat.org/isbn/9783642084690> ;
    schema:workExample <http://worldcat.org/isbn/9783540653677> ;
    umbel:isLike <http://bnb.data.bl.uk/id/resource/GBA143407> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/47097680> ;
    .


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/1074724#Topic/algorithmes> # Algorithmes
    a schema:Intangible ;
    schema:name "Algorithmes"@en ;
    schema:name "Algorithmes"@fr ;
    .

<http://experiment.worldcat.org/entity/work/data/1074724#Topic/approximation_theorie_de_l> # Approximation, Théorie de l'
    a schema:Intangible ;
    schema:name "Approximation, Théorie de l'"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/1074724#Topic/benaderingen_wiskunde> # Benaderingen (wiskunde)
    a schema:Intangible ;
    schema:name "Benaderingen (wiskunde)"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/1074724#Topic/mathematische_programmering> # Mathematische programmering
    a schema:Intangible ;
    schema:name "Mathematische programmering"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/1074724#Topic/optimisation_mathematique> # Optimisation mathématique
    a schema:Intangible ;
    schema:name "Optimisation mathématique"@en ;
    schema:name "Optimisation mathématique"@fr ;
    .

<http://id.worldcat.org/fast/1012099> # Mathematical optimization
    a schema:Intangible ;
    schema:name "Mathematical optimization"@en ;
    .

<http://id.worldcat.org/fast/872010> # Computer algorithms
    a schema:Intangible ;
    schema:name "Computer algorithms"@en ;
    .

<http://viaf.org/viaf/300626> # Vijay V. Vazirani
    a schema:Person ;
    schema:familyName "Vazirani" ;
    schema:givenName "Vijay V." ;
    schema:name "Vijay V. Vazirani" ;
    .

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

<http://worldcat.org/isbn/9783642084690>
    a schema:ProductModel ;
    schema:isbn "3642084699" ;
    schema:isbn "9783642084690" ;
    .

<http://www.worldcat.org/title/-/oclc/47097680#Review/1830919561>
    a schema:Review ;
    schema:itemReviewed <http://www.worldcat.org/oclc/47097680> ; # Approximation algorithms
    schema:reviewBody ""The challenge met by this book is to capture the beauty and excitement of work in this thriving field and to convey in a lucid manner the underlying theory and methodology. Many of the research results presented have been simplified, and new insights provided. Perhaps the most important aspect of the book is that it shows simple ways of talking about complex, powerful algorithmic ideas by giving intuitive proofs, by writing algorithms in plain English, and by providing numerous critical examples and illustrations."" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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