Approximation algorithms von vazirani vijay (14 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.…

Hardcover. Zustand: Very Good. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Hardcover. Zustand: Fair. No Jacket. Former library book; Missing dust jacket; Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less.

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

Zustand: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.…

Zustand: good. Befriedigend/Good: Durchschnittlich erhaltenes Buch bzw. Schutzumschlag mit Gebrauchsspuren, aber vollständigen Seiten. / Describes the average WORN book or dust jacket that has all the pages present.

paperback. Zustand: Very Good.

Zustand: New. In English.

Zustand: New. In English.

Zustand: New. In English.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The Workshop on Approximation Algorithms for Combinatorial Optimization Problems APPROX 2002 focused on algorithmic and complexity aspects ar- ing in the development of e cient approximate solutions to computationally d- cult problems. It aimed, in particular, to foster cooperation among algorithmic and complexity researchers in the eld. The workshop, held at the University of Rome La Sapienza, Rome, Italy, was part of the ALGO 2002 event, in conju- tion with ESA 2002 and WABI 2002. We would like to thank the local organizers at the University of Rome La Sapienza for this opportunity. APPROX is an - nual meeting, with previous workshops in Aalborg, Berkeley, Saarbruc ken, and Berkeley. Previous proceedings appeared as LNCS 1444, 1671, 1913, and 2129. Topics of interest for APPROX 2002 were: design and analysis of approxi- tion algorithms, inapproximability results, on-line problems, randomization te- niques, average-case analysis, approximation classes, scheduling problems, ro- ing and ow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, applications to game theory, and other applications. The number of submitted papers to APPROX 2002 was 54 from which 20 papers were selected. This volume contains the selected papers together with abstracts of invited lectures by Yuval Rabani (Technion) and R. …

Zustand: New. In English.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. …

Taschenbuch. Zustand: Neu. Approximation Algorithms | Vijay V. Vazirani | Taschenbuch | xix | Englisch | 2010 | J.B. Metzler | EAN 9783642084690 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …