Your cart is empty.
  • Home

    Approximation algorithms / Vijay V. Vazirani.

    By: Vazirani, Vijay VMaterial type: TextTextPublisher: Berlin ; New York : Springer, c2003Edition: Corr. 2nd printDescription: xix, 380 p. : ill. ; 25 cmISBN: 3540653678 (alk. paper); 9783540653677 (alk. paper)Subject(s): Computer algorithms | Mathematical optimizationDDC classification: 511.8 LOC classification: QA76.9.A43 | V39 2003
    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.
    Tags from this library: No tags from this library for this title. Log in to add tags.
        Average rating: 0.0 (0 votes)
    Item type Current library Call number Copy number Status Notes Date due Barcode
    Books Books Female Library
    		QA76.9 .A43 V39 2003 (Browse shelf (Opens below)) 1 Available STACKS 51952000078234
    Books Books Main Library
    		QA76.9 .A43 V39 2003 (Browse shelf (Opens below)) 1 Available STACKS 51952000055921

    Includes bibliographical references (p. [357]-372) and index.

    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.

    1 2

    There are no comments on this title.

    to post a comment.