Approximation Algorithms (Paperback)

Vijay V. Vazirani

57 valoraciones de Goodreads

Idioma: inglés

Editorial: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2010

3642084699 / 9783642084690

  • Primera edición
  • Tapa blanda
  • Nuevo
Ver todos los detalles

Librería: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller

Vendedor de 5 estrellas

Vendedor de IberLibro desde 22 de junio de 2007

Tapa blanda

Condición: Nuevo

EUR 107,24

Envío por EUR 32,97 
Se envía de Australia a Estados Unidos de America

Cantidad disponible: 1 disponible

Añadir al carrito
Devoluciones gratuitas de 30 días

Descripción del artículo del vendedor

Paperback. Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed conjecture that PNP, 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. Part I covers combinatorial algorithms for a number of important problems, using a wide variety of algorithm design techniques. 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; Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.…

N° de ref. del artículo 9783642084690

Título
Approximation Algorithms (Paperback)
Autor
Vijay V. Vazirani
Editorial
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin
Año de publicación
2010
Estado
new
Encuadernación
Paperback
Idioma
inglés
ISBN 10
3642084699
ISBN 13
9783642084690
Edición
1ª Edición

AussieBookSeller

Truganina, VIC, Australia

Vendedor de 5 estrellas

Vendedor de IberLibro desde 22 de junio de 2007

Tarifas de envío de Australia a Estados Unidos de America

ArtículoDe 25 a 45 días hábilesDe 8 a 14 días hábiles
Primer artículoEUR 32,97EUR 39,21
Los plazos de entrega los establecen los vendedores y varían según el transportista y la ubicación. Los pedidos que pasan por la aduana pueden sufrir retrasos y los compradores son responsables de los aranceles o tarifas asociadas. Los vendedores pueden ponerse en contacto con usted en relación con cargos adicionales para cubrir cualquier aumento en los costes de envío de los artículos.

Métodos de pago

  • Visa
  • Mastercard
  • American Express
  • Carte Bleue
  • Apple Pay
  • Google Pay

Información empresarial del vendedor

The Nile Group Pty Ltd

42 Apex Drive
Truganina, VIC Australia 3029