EVERYDAY FREE SHIPPING on $25 & up  Excludes Marketplace items
EVERYDAY FREE SHIPPING
on $25 & up
 Excludes Marketplace
Approximation Algorithms

Approximation Algorithms - 01 edition

ISBN13: 978-3540653677

Cover of Approximation Algorithms 01 (ISBN 978-3540653677)
ISBN13: 978-3540653677
ISBN10: 3540653678
Cover type:
Edition: 01
Copyright: 2001
Publisher: Springer-Verlag New York
Published: 2001
International: No

More Shipping Options

Approximation Algorithms - 01 edition

ISBN13: 978-3540653677

Vijay Vazirani

ISBN13: 978-3540653677
ISBN10: 3540653678
Cover type:
Edition: 01
Copyright: 2001
Publisher: Springer-Verlag New York
Published: 2001
International: No
Summary

Approximation algorithms are currently a central and fast-developing area of research in theoretical computer science. This monograph covers the basic techniques used in the latest research work, techniques that everyone in the field should know, and shows that they form the beginnings of a promising theory. The author consolidates progress made so far, including some very recent results, and makes a strong effort to convey the beauty and excitement of work in the field.

Author Bio

Vazirani,Vijay : Georgia Institute of Technology

Table of Contents

Introduction.

I. Combinatorial Algorithms: Set cover.

Steiner tree and TSP.
Multiway cuts and k-cuts.
k-center.
Feedback vertex set.
Shortest superstring.
Knapsack.
Bin packing.
Minimum makespan scheduling.
Euclidean TSP.

II. LP-Based Algorithms: Introduction to LP-duality.

Rounding applied to set cover.
LP-duality based analysis for set cover.
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.

III. Other Topics: Counting problems.

Shortest vector.
Hardness of approximation.
Open problems.

  • Marketplace
  • From
More Shipping Options