Idioma: Inglés
Publicado por Springer Verlag, New York, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Librería: Doss-Haus Books, Redondo Beach, CA, Estados Unidos de America
EUR 16,26
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Very Good. No Jacket. Hardcover 2001 library bound edition. Ex-library book with stamps and labels attached. Binding firm. Pages unmarked and clean. Laminated covers and text in very good condition. Series: Lecture Notes in Computer Science ;2129. 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, Berkeley, CA, USA, August 18-20, 2001 Proceedings. [ix, 296 p. : ill. ; 24 cm].
Librería: Universitätsbuchhandlung Herta Hold GmbH, Berlin, Alemania
EUR 10,00
Cantidad disponible: 1 disponibles
Añadir al carritoIX, 296 p. Softcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Lecture Notes in Computer Science, Vol. 2129. Sprache: Englisch.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 52,81
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 51,65
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 60,12
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 64,19
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
EUR 65,94
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: New. 2001 ed.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 58,39
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Chiron Media, Wallingford, Reino Unido
EUR 56,56
Cantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 71,71
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 312.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 58,38
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 66,19
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Berlin Springer Verlag, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Librería: CSG Onlinebuch GMBH, Darmstadt, Alemania
EUR 14,88
Cantidad disponible: 1 disponibles
Añadir al carritoSoftcover. Condición: Sehr gut. Gebraucht - Sehr gut Zustand: Sehr gut, Mängelexemplar, IX, 297 pp. About this book This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields. Written for researchers and professionals.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 53,49
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 2001, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 53,49
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Neuware -This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 320 pp. Englisch.
Idioma: Inglés
Publicado por Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Librería: Rarewaves.com UK, London, Reino Unido
EUR 61,07
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: New. 2001 ed.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg Aug 2001, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 53,49
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields. 320 pp. Englisch.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 69,57
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. 312 Illus.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 72,50
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 312.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Librería: moluna, Greven, Alemania
EUR 48,37
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science,.
Librería: preigu, Osnabrück, Alemania
EUR 50,25
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques | 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA,USA, Augu | Michel Goemans (u. a.) | Taschenbuch | ix | Englisch | 2001 | Springer | EAN 9783540424703 | 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.