£48.91

Springer Approximation Algorithms

Name: Approximation Algorithms
Brand: Springer
Price: 48.91 GBP
Availability: InStock

Operational Research

Price History & Forecast

Last 2 days • 2 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 2 days • 1 price levels

Days at Price

Price Analysis

Most common price: £49 (2 days, 100.0%)

Price range: £49 - £49

Price levels: 1 different prices over 2 days

Description

Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed conjecture that P≠NP, their exact solution is prohibitively time consuming. Charting the landscape of approximability of these problems, via polynomial-time algorithms, therefore becomes a compelling subject of scientific inquiry in computer science and mathematics. This book presents the theory of approximation algorithms. This book is divided into three parts. Part I covers combinatorial algorithms for a number of important problems, using a wide variety of algorithm design techniques. Part II presents linear programming based algorithms. These are categorized under two fundamental techniques: rounding and the primal-dual schema. Part III covers four important topics: the first is the problem of finding a shortest vector in a lattice; the second is the approximability of counting, as opposed to optimization, problems; the third topic is centered around recent breakthrough results, establishing hardness of approximation for many key problems, and giving new legitimacy to approximation algorithms as a deep theory; and the fourth topic consists of the numerous open problems of this young field. This book is suitable for use in advanced undergraduate and graduate-level courses on approximation algorithms. An undergraduate course in algorithms and the theory of NP-completeness should suffice as a prerequisite for most of the chapters. This book can also be used as supplementary text in basic undergraduate and graduate algorithms courses.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 3642084699
Category: Books > Subjects > Business, Finance & Law > Management > Operational Research
Domain: Amazon UK
Release Date: 08 December 2010
Listed Since: 14 June 2010

Barcode

No barcode data available

Springer Approximation Algorithms

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Approximation Algorithms

The Design of Approximation Algorithms

Design and Analysis of Approximation Algorithms: 62 (Springer Optimization and Its Applications, 62)

Parameterized Algorithms

Parameterized Algorithms

Springer Nonlinear Programming and Variational Inequality Problems

Handbook of Approximation Algorithms and Metaheuristics: Contemporary and Emerging Applications, Volume 2 (Chapman & Hall/CRC Computer and Information Science Series)

Handbook of Approximation Algorithms and Metaheuristics, Second Edition: Two-Volume Set (Chapman & Hall/CRC Computer and Information Science Series)

Handbook of Approximation Algorithms and Metaheuristics: Methologies and Traditional Applications, Volume 1 (Chapman & Hall/CRC Computer and Information Science Series)

Advances in Optimization and Approximation: 1 (Nonconvex Optimization and Its Applications)

Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems: 42 (Nonconvex Optimization and Its Applications, 42)

Handbook of Approximation Algorithms and Metaheuristics, Second Edition: Two-Volume Set (Chapman & Hall/CRC Computer and Information Science Series)

Optimization and Learning via Stochastic Gradient Search (Princeton Series in Applied Mathematics)

Linear and Integer Optimization: Theory and Practice, Third Edition (Advances in Applied Mathematics)

Nonlinear Programming: Theory and Algorithms

Geometric Approximation Algorithms (Mathematical Surveys and Monographs)

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 10th International Workshop, APPROX 2007, and 11th ... (Lecture Notes in Computer Science, 4627)

Nonlinear Assignment Problems: Algorithms and Applications: 7 (Combinatorial Optimization, 7)

Advances In Combinatorial Optimization: Linear Programming Formulations Of The Traveling Salesman And Other Hard Combinatorial Optimization Problems

Introduction to Combinatorial Optimization: 196 (Springer Optimization and Its Applications, 196)

Practical Optimization Methods : With Mathematical Applications

Practical Optimization: Algorithms and Engineering Applications

Numerical Linear Approximation in C (Chapman & Hall/CRC Numerical Analysis and Scientific Computing)

Discrete Optimization (Computer Science and Scientific Computing)