Logo - springer
Slogan - springer

Mathematics | Design and Analysis of Approximation Algorithms

Design and Analysis of Approximation Algorithms

Du, Ding-Zhu, Ko, Ker-I, Hu, Xiaodong

2012, XII, 440 p.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$49.99

(net) price for USA

ISBN 978-1-4614-1701-9

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$74.95

(net) price for USA

ISBN 978-1-4614-1700-2

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$74.95

(net) price for USA

ISBN 978-1-4899-9844-6

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • The technique-oriented approach provides a unified view of the design techniques for approximation algorithms
  • Detailed algorithms, as well as complete proofs and analyses, are presented for each technique
  • Numerous examples help the reader to better understand the design and analysis techniques
  • Collects a great number of applications, many from recent research papers
  • Includes a large collection of approximation algorithms of geometric problems

When precise algorithmic solutions are difficult to compute, the use of approximation algorithms can help. Design and Analysis of Approximation Algorithms is a textbook for a graduate course in theoretical computer science taught globally in universities. It can also be used as a reference work for researchers in the area of design and analysis algorithms.

 

There are few texts available for this standard course, and those that do exist mainly follow a problem-oriented format. This text follows a structured, technique-oriented presentation. Approximation algorithms are organized into chapters based on the design techniques for the algorithms, enabling the reader to study algorithms of the same nature with ease, and providing an improved understanding of the design and analysis techniques for approximation algorithms. Instructors benefit from this approach allowing for an easy way to present the ideas and techniques of algorithms with a unified approach.

Content Level » Graduate

Keywords » NP-completeness - approximation algorithms - combinatorial optimization - greedy algorithms - linear programming

Related subjects » Mathematics - Theoretical Computer Science

Table of contents / Preface / Sample pages 

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Optimization.