Approximation algorithms von vazirani vijay (63 Ergebnisse)

Hardback. Zustand: Fair. In Part I we cover combinato rial algorithms for a number of important problems, using a wide variety of algorithm design techniques. Instead, we have attempted to capture, as accurately as possible, the individual character of each problem, and point out connections between problems and algorithms for solving them.…

Hardback. Zustand: Fair. In Part I we cover combinato rial algorithms for a number of important problems, using a wide variety of algorithm design techniques. Instead, we have attempted to capture, as accurately as possible, the individual character of each problem, and point out connections between problems and algorithms for solving them.…

Hardcover. Zustand: Good. 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.

Hardcover. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

Zustand: good. This book is in good condition. The cover has minor creases or bends. The binding is tight and pages are intact. Some pages may have writing or highlighting.

unknown_binding. Zustand: Good. 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.

paperback. Zustand: Very Good.

paperback. Zustand: Good. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).

N.A. Zustand: New. ISBN:9788181283856.

Zustand: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.…

Zustand: As New. Unread book in perfect condition.

Zustand: As New. Unread book in perfect condition.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Hardcover. Zustand: new. New Copy. Customer Service Guaranteed.

Zustand: New. In English.

Paperback. Zustand: New. 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. Softcover reprint of hardcover 1st ed. 2001.…

Paperback. Zustand: New.

Zustand: New.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Zustand: New.

Zustand: New.

hardcover. Zustand: New. In shrink wrap. Looks like an interesting title.

hardcover. Zustand: New. In shrink wrap. Looks like an interesting title.

Zustand: New. In English.

Zustand: New.

Paperback. Zustand: New.

Zustand: As New. Unread book in perfect condition.