EVERYDAY FREE SHIPPING on $25 & up - Excludes marketplace items & rentals.
EVERYDAY FREE SHIPPING on $25 & up - Excludes marketplace items & rentals.
EVERYDAY FREE SHIPPING on $25 & up - Excludes marketplace items & rentals
Search
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/Copyright: 01
Publisher: Springer-Verlag New York
Published: 2001
International: No
Sell this book right now for CASH!
Sell this book
right now for
$7.50 CASH!

List price: $79.99

USED
Sold Out
FREE Shipping on $25+
  • Ships Monday
  • 30-Day Returns
  • Condition: Very Good
Sold Out
rental
$58.99
Save $21.00 (26%)


Ships from $5.99
  • Free Return Shipping
  • Due back 12/18/2015
  •  
More Shipping Options

Approximation Algorithms - 01 edition

ISBN13: 978-3540653677

Vijay Vazirani

ISBN13: 978-3540653677
ISBN10: 3540653678
Cover type:
Edition/Copyright: 01
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.

List price: $79.99
  • Rental
  • $58.99
  • Marketplace
  • From
More Shipping Options