skip to content
Approximation algorithms Preview this item
ClosePreview this item

Approximation algorithms

Author: Vijay V Vazirani
Publisher: Berlin : Springer, 2003.
Edition/Format:   Print book : English : Corr. 2. printingView all editions and formats

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...


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

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...


Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: Vijay V Vazirani
ISBN: 3540653678 9783540653677
OCLC Number: 249006472
Description: XIX, 380 Seiten : Illustrationen
Contents: 1 Introduction.- I. Combinatorial Algorithms.- 2 Set Cover.- 3 Steiner Tree and TSP.- 4 Multiway Cut and k-Cut.- 5 k-Center.- 6 Feedback Vertex Set.- 7 Shortest Superstring.- 8 Knapsack.- 9 Bin Packing.- 10 Minimum Makespan Scheduling.- 11 Euclidean TSP.- II. LP-Based Algorithms.- 12 Introduction to LP-Duality.- 13 Set Cover via Dual Fitting.- 14 Rounding Applied to Set Cover.- 15 Set Cover via the Primal-Dual Schema.- 16 Maximum Satisfiability.- 17 Scheduling on Unrelated Parallel Machines.- 18 Multicut and Integer Multicommodity Flow in Trees.- 19 Multiway Cut.- 20 Multicut in General Graphs.- 21 Sparsest Cut.- 22 Steiner Forest.- 23 Steiner Network.- 24 Facility Location.- 25 k-Median.- 26 Semidefinite Programming.- III. Other Topics.- 27 Shortest Vector.- 28 Counting Problems.- 29 Hardness of Approximation.- 30 Open Problems.- A An Overview of Complexity Theory for the Algorithm Designer.- A.3.1 Approximation factor preserving reductions.- A.4 Randomized complexity classes.- A.5 Self-reducibility.- A.6 Notes.- B Basic Facts from Probability Theory.- B.1 Expectation and moments.- B.2 Deviations from the mean.- B.3 Basic distributions.- B.4 Notes.- References.- Problem Index.
Responsibility: Vijay V. Vazirani.


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...


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

<> # Approximation algorithms
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "249006472" ;
   library:placeOfPublication <> ;
   library:placeOfPublication <> ; # Berlin
   schema:about <> ; # Approximationsalgorithmus
   schema:about <> ;
   schema:bookEdition "Corr. 2. printing." ;
   schema:bookFormat bgn:PrintBook ;
   schema:creator <> ; # Vijay V. Vazirani
   schema:datePublished "2003" ;
   schema:exampleOfWork <> ;
   schema:inLanguage "en" ;
   schema:name "Approximation algorithms" ;
   schema:productID "249006472" ;
   schema:publication <> ;
   schema:publisher <> ; # Springer
   schema:url <> ;
   schema:workExample <> ;
   wdrs:describedby <> ;

Related Entities

<> # Approximationsalgorithmus
    a schema:Intangible ;
   schema:name "Approximationsalgorithmus" ;

<> # Vijay V. Vazirani
    a schema:Person ;
   schema:familyName "Vazirani" ;
   schema:givenName "Vijay V." ;
   schema:name "Vijay V. Vazirani" ;

    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.