APPROXIMATION ALGORITHMS

VAZIRANI VIJAY V.

ISBN 10: 8181283856 / ISBN 13: 9788181283856

Published by SPRINGER (SIE), 2013

About this Item

Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!

Seller Inventory # S_381050108

Bibliographic Details

• Title: APPROXIMATION ALGORITHMS
• Publisher: SPRINGER (SIE)
• Publication Date: 2013
• Language: English
• ISBN 10: 8181283856
• ISBN 13: 9788181283856
• Binding: unknown_binding
• Condition: Good

About this title

Synopsis

Although this may seem a paradox, all exact science is dominated by the idea of approximation. Bertrand Russell (1872-1970) Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed con­ jecture 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 ap­ proximation algorithms as it stands today. It is reasonable to expect the picture to change with time. This book is divided into three parts. In Part I we cover combinato­ rial algorithms for a number of important problems, using a wide variety of algorithm design techniques. The latter may give Part I a non-cohesive appearance. However, this is to be expected - nature is very rich, and we cannot expect a few tricks