Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Ausiello, G.; Crescenzi, P.; Kann, V.; Marchetti-sp; Gambosi, Giorgio; Spaccamela, Alberto M.

ISBN 10: 3540654313 ISBN 13: 9783540654315

Editorial: Springer, 1999

Idioma: Ingl�s

Condici�n: Nuevo Encuadernaci�n de tapa dura

Guardar para m�s tarde

Vendido por Ria Christie Collections, Uxbridge, Reino Unido

Vendedor de AbeBooks desde 25 de marzo de 2015

Calificaci�n del vendedor: 5 de 5 estrellas

Ver los art�culos de este vendedor

Ver todos los ejemplares de este libro

Nuevos - Encuadernaci�n de tapa dura

Condici�n: Nuevo

Precio: EUR 99,30 Convertir moneda

EUR 5,18 gastos de env�o desde Reino Unido a Espa�a Destinos, gastos y plazos de env�o

Cantidad disponible: M�s de 20 disponibles

A�adir al carrito

Guardar para m�s tarde

Descripci�n

In.

N� de ref. del art�culo ria9783540654315_new

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Editor

Springer

Fecha de publicaci�n

1999

Idioma

Ingl�s

ISBN 10

3540654313

ISBN 13

9783540654315

Encuadernaci�n

Encuadernaci�n de tapa dura

Estado

New

Cat�logos de vendedores

Acerca de

Sinopsis

N COMPUTER applications we are used to live with approximation. Var� I ious notions of approximation appear, in fact, in many circumstances. One notable example is the type of approximation that arises in numer� ical analysis or in computational geometry from the fact that we cannot perform computations with arbitrary precision and we have to truncate the representation of real numbers. In other cases, we use to approximate com� plex mathematical objects by simpler ones: for example, we sometimes represent non-linear functions by means of piecewise linear ones. The need to solve difficult optimization problems is another reason that forces us to deal with approximation. In particular, when a problem is computationally hard (i. e. , the only way we know to solve it is by making use of an algorithm that runs in exponential time), it may be practically unfeasible to try to compute the exact solution, because it might require months or years of machine time, even with the help of powerful parallel computers. In such cases, we may decide to restrict ourselves to compute a solution that, though not being an optimal one, nevertheless is close to the optimum and may be determined in polynomial time. We call this type of solution an approximate solution and the corresponding algorithm a polynomial-time approximation algorithm. Most combinatorial optimization problems of great practical relevance are, indeed, computationally intractable in the above sense. In formal terms, they are classified as Np-hard optimization problems.

Rese�a del editor

This book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems. The wealth of problems, algorithms, results, and techniques make it an indispensible source of reference for professionals. The text smoothly integrates numerous illustrations, examples, and exercises.

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Descripci�n de la librer�a

Hello! Ria Christie Collections is an online venture that was initially set up in 2012 to sell books. We do not have a physical high street store. We are professional online booksellers. We only sell brand new books in perfect condition that we source from various suppliers and the publishers. Primarily, our aim is to provide an excellent service to all our customers. We always work as a team to achieve this. Our other objectives are to: 1. Ensure that all our products reach their destination quickly in a safe and secure manner 2. Answer to all our customer queries within 24 hours 3. Ensure that our customers are happy with their purchases 4. Provide all the items at a competitive price 5. Always listen to our customers Ria Christie Collections is not a registered company. It is a Sole Trader venture. Other key information is shown below: Contact Person Name: Rakesh Luchmun (Mr) Storefront Name: Ria Christie Collections Place of Establishment Address: Suite B; ARUN House; ARUN Building Arundel Road Uxbridge UB8 2RR United Kingdom E-Mail Address: riachristie@hotmail.co.uk VAT Number: GB 160 5650 25 We always work hard and aim to comply with all of Abebooks Policies. If you have any issues, please do not hesitate to write to us whether before or after a purchase. We promise to reply to you promptly and, in any case, within 24 hours. Thank you kindly! Yours sincerely Mr Rakesh Luchmun (Founder) and the Ria Christie Collections Team

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

Ryefield Investments Limited
175 Pield Heath Road, Uxbridge, UB8 3NL, United Kingdom

Condiciones de venta y env�o

Condiciones de venta

All Returns and Refund are as per Abebooks policies.

Derecho a cancelaci�n

Condiciones de env�o

Orders usually ship within 2 business days. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required. Thank you!

Tarifas de env�o de Reino Unido a Espa�a

Tarifas de env�o de Reino Unido a Espa�a
Cantidad del pedido	De 5 a 8 d�as h�biles	De 5 a 8 d�as h�biles
Primer art�culo	EUR 5.18	EUR 5.18

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.