Amazon cover image
Image from Amazon.com

Design and analysis of approximation algorithms

By: Contributor(s): Series: Springer Optimization and its Applications 62Publication details: 2012 Springer New YorkDescription: xi, 440 pISBN:
  • 9781461417002
Subject(s): DDC classification:
  • 518.1 D8D3
Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Item location Collection Shelving location Call number Status Date due Barcode
Books Vikram Sarabhai Library Rack 28-B / Slot 1390 (0 Floor, East Wing) Non-fiction General Stacks 518.1 D8D3 (Browse shelf(Opens below)) Available 180617


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.

There are no comments on this title.

to post a comment.