Coverart for item
The Resource Approximation algorithms, Vijay V. Vazirani

Approximation algorithms, Vijay V. Vazirani

Label
Approximation algorithms
Title
Approximation algorithms
Statement of responsibility
Vijay V. Vazirani
Creator
Subject
Language
eng
Cataloging source
DLC
http://library.link/vocab/creatorName
Vazirani, Vijay V
Illustrations
illustrations
Index
index present
Literary form
non fiction
Nature of contents
bibliography
http://library.link/vocab/subjectName
  • Computer algorithms
  • Mathematical optimization
Label
Approximation algorithms, Vijay V. Vazirani
Instantiates
Publication
Note
  • "Corrected second printing 2003" -- T.p. verso
  • "Corrected second printing 2003" -- T.p. verso
Bibliography note
Includes bibliographical references (p. [355]-370) and indexes
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
Control code
ocm47097680
Dimensions
25 cm.
Extent
xix, 380 p.
Isbn
9783642084690
Lccn
2001042005
Other physical details
ill.
Label
Approximation algorithms, Vijay V. Vazirani
Publication
Note
  • "Corrected second printing 2003" -- T.p. verso
  • "Corrected second printing 2003" -- T.p. verso
Bibliography note
Includes bibliographical references (p. [355]-370) and indexes
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
Control code
ocm47097680
Dimensions
25 cm.
Extent
xix, 380 p.
Isbn
9783642084690
Lccn
2001042005
Other physical details
ill.

Library Locations

    • Harold Cohen LibraryBorrow it
      Ashton Street, Liverpool, L69 3DA, GB
      53.418074 -2.967913
Processing Feedback ...