Librería: World of Books (was SecondSale), Montgomery, IL, Estados Unidos de America
EUR 11,30
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc.
Publicado por Springer (edition Corrected), 1999
ISBN 10: 3540654313 ISBN 13: 9783540654315
Idioma: Inglés
Librería: BooksRun, Philadelphia, PA, Estados Unidos de America
EUR 12,79
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Good. Corrected. It's a preowned item in good condition and includes all the pages. It may have some general signs of wear and tear, such as markings, highlighting, slight damage to the cover, minimal wear to the binding, etc., but they will not affect the overall reading experience.
Librería: HPB-Red, Dallas, TX, Estados Unidos de America
EUR 11,41
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritohardcover. 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!
Publicado por Springer Berlin / Heidelberg, 1999
ISBN 10: 3540654313 ISBN 13: 9783540654315
Idioma: Inglés
Librería: Better World Books Ltd, Dunfermline, Reino Unido
EUR 16,87
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: Good. Ships from the UK. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.
Librería: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Alemania
EUR 12,99
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover-Großformat. Condición: Gut. XIX, 524 Seiten; In ENGLISCHER Sprache. Der Erhaltungszustand des hier angebotenen Werks ist trotz seiner Bibliotheksnutzung sehr sauber und kann entsprechende Merkmale aufweisen (Rückenschild, Instituts-Stempel.). Sprache: Englisch Gewicht in Gramm: 1175.
Librería: Antiquariat Bookfarm, Löbnitz, Alemania
EUR 16,92
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carrito2. 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.
Librería: Phatpocket Limited, Waltham Abbey, HERTS, Reino Unido
EUR 54,97
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondició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.
Librería: GoldBooks, Denver, CO, Estados Unidos de America
EUR 79,53
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: new.
Librería: BennettBooksLtd, San Diego, NV, Estados Unidos de America
EUR 83,39
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritohardcover. Condición: New. In shrink wrap. Looks like an interesting title!
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 98,77
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 112,36
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 118,99
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Brand New. 548 pages. 9.50x7.10x1.00 inches. In Stock.
Librería: preigu, Osnabrück, Alemania
EUR 66,65
Convertir monedaCantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Complexity and Approximation | Combinatorial Optimization Problems and Their Approximability Properties | Giorgio Ausiello (u. a.) | Taschenbuch | xx | Englisch | 2013 | Springer | EAN 9783642635816 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Publicado por Springer Berlin Heidelberg, 2013
ISBN 10: 3642635814 ISBN 13: 9783642635816
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 74,89
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. 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 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.
Publicado por Springer Berlin Heidelberg, 1999
ISBN 10: 3540654313 ISBN 13: 9783540654315
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 90,90
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoBuch. 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 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.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 134,70
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Like New. Like New. book.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 144,15
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Like New. Like New. book.
Librería: Antiquariaat Van Veen, Veelerveen, Holanda
EUR 60,00
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoBerlin/Heidelberg, Springer-Verlag, 1999. 1st edition 524 pages. HB . With 69 Figures and 4 Tables. very good condition.
Librería: preigu, Osnabrück, Alemania
EUR 79,90
Convertir monedaCantidad disponible: 5 disponibles
Añadir al carritoBuch. Condición: Neu. Complexity and Approximation | Combinatorial Optimization Problems and Their Approximability Properties | Giorgio Ausiello (u. a.) | Buch | xx | Englisch | 1999 | Springer-Verlag GmbH | EAN 9783540654315 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.