9783540654315 - complexity and approximation: combinatorial optimization problems and their approximability properties (15 resultados)
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Ausiello, G.,Crescenzi, P.,Kann, V.,Marchetti-sp,Gambosi, Giorgio,Spaccamela, Alberto M.
- Tapa dura
Librería: HPB-Red, Dallas, TX, Estados Unidos de AmericaHPB-Red
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Aceptable
EUR 17,20
Envío por EUR 3,26Se envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
hardcover. Condición: 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.
- Tapa dura
Librería: medimops, Berlin, Alemaniamedimops
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Aceptable
EUR 16,41
Envío por EUR 20,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Condición: 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.
- Tapa dura
Librería: Phatpocket Limited, Waltham Abbey, HERTS, Reino UnidoPhatpocket Limited
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Aceptable
EUR 32,47
Envío por EUR 12,42Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Condición: 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.
- Más imágenes
Complexity and approximation. Combinatorial optimization problems and their approximability properties ; with 4 tables.
Ausiello, Giorgio; Crescenzi, Pierluigi; Gambosi, Giorgio; Kann, Viggo; Marchetti-Spaccamela, Alberto; Protasi, Marco
- Tapa dura
Librería: Antiquariat Bookfarm, Löbnitz, AlemaniaAntiquariat Bookfarm
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Bueno
EUR 19,90
Envío por EUR 40,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Condición: Gut. 2. corrected print. 524 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. 9783540654315 Sprache: Englisch Gewicht in Gramm: 990.
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Ausiello, G.; Crescenzi, P.; Kann, V.; Marchetti-sp; Gambosi, Giorgio; Spaccamela, Alberto M.
- Tapa dura
Librería: BennettBooksLtd, Los Angeles, CA, Estados Unidos de AmericaBennettBooksLtd
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 84,19
Envío por EUR 6,04Se envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
hardcover. Condición: New. In shrink wrap. Looks like an interesting title.
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Ausiello, Giorgio; Crescenzi, Pierluigi; Gambosi, Giorgio; Kann, Viggo; Marchetti-Spaccamela, Alberto; Protasi, Marco
- Tapa dura
Librería: Ria Christie Collections, Uxbridge, Reino UnidoRia Christie Collections
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 99,84
Envío por EUR 13,98Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New. In.
- Tapa dura
Librería: Books Puddle, New York, NY, Estados Unidos de AmericaBooks Puddle
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 133,98
Envío por EUR 3,47Se envía dentro de Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. pp. xx + 524 2nd Corrected Printing.
- Más imágenes
- Tapa dura
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 97,52
Envío por EUR 66,28Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 fr…om 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.
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Ausiello, G., Crescenzi, P., Kann, V., Marchetti-sp, Gambosi
- Tapa dura
Librería: Mispah books, Redhill, SURRE, Reino UnidoMispah books
Contactar con el vendedorVendedor de 4 estrellasCondición: Usado - Como Nuevo
EUR 164,66
Envío por EUR 29,17Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardcover. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Complexity and Approximation
Ausiello, Giorgio; Crescenzi, Pierluigi; Gambosi, Giorgio; Kann, Viggo; Marchetti-Spaccamela, Alberto; Protasi, Marco
- Tapa dura
- Impresión bajo demanda
Librería: Basi6 International, Irving, TX, Estados Unidos de AmericaBasi6 International
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 88,00
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: 10 disponibles
Condición: Brand New. New. US edition. Print on demand title. Delivery takes 20-25 days. Excellent Customer Service.
- Más imágenes
- Tapa dura
- Impresión bajo demanda
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 90,90
Envío por EUR 23,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 computati…onal 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. 548 pp. Englisch.
- Más imágenes
- Tapa dura
- Impresión bajo demanda
Librería: moluna, Greven, Alemaniamoluna
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 77,13
Envío por EUR 48,99Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Gebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Comprehensive Assessment of numerous problems in combinatorial optimizationThis book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant c…lasses of NP-hard optimization probl.
- Tapa dura
- Impresión bajo demanda
Librería: Majestic Books, Hounslow, Reino UnidoMajestic Books
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 134,24
Envío por EUR 7,58Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. Print on Demand pp. xx + 524.
- Tapa dura
- Impresión bajo demanda
Librería: Biblios, frankfurt am main, HESSE, AlemaniaBiblios
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 137,79
Envío por EUR 9,95Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. PRINT ON DEMAND pp. xx + 524.
- Más imágenes
Idioma: Inglés
Editorial: Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 1999, 1999
- Tapa dura
- Impresión bajo demanda
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 90,90
Envío por EUR 60,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Buch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 548 pp. Englisch.
