Librería: Universitätsbuchhandlung Herta Hold GmbH, Berlin, Alemania
EUR 10,00
Convertir monedaCantidad 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.
Publicado por Berlin Springer Verlag, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Idioma: Inglés
Librería: CSG Onlinebuch GMBH, Darmstadt, Alemania
EUR 14,88
Convertir monedaCantidad 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.
Publicado por Springer Verlag, New York, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Idioma: Inglés
Librería: Doss-Haus Books, Redondo Beach, CA, Estados Unidos de America
EUR 16,53
Convertir monedaCantidad 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: online-buch-de, Dozwil, Suiza
EUR 46,55
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: gebraucht; wie neu. ungebraucht, evtl. minimalste Lagerspuren.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 61,33
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 61,33
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Publicado por Springer Berlin Heidelberg, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 53,49
Convertir monedaCantidad 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.
Publicado por Springer Berlin Heidelberg, 2005
ISBN 10: 3540282394 ISBN 13: 9783540282396
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 53,49
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains the papers presented at the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2005) and the 9th International Workshop on Randomization and Computation(RANDOM2005),whichtookplaceconcurrentlyattheUniversity of California in Berkeley, on August 22 24, 2005. APPROX focuses on algori- mic and complexity issues surrounding the development of e cient approximate solutions to computationally hard problems, and APPROX 2005 was the eighth in the series after Aalborg (1998), Berkeley (1999), Saarbru cken (2000), Ber- ley (2001),Rome (2002),Princeton(2003),and Cambridge(2004).RANDOM is concerned with applications of randomness to computational and combinatorial problems, and RANDOM 2005 was the ninth workshop in the series foll- ing Bologna (1997), Barcelona (1998), Berkeley(1999), Geneva (2000), Berkeley (2001), Harvard (2002), Princeton (2003), and Cambridge (2004). Topics of interest for APPROX and RANDOM are: design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, mathematical programming methods, coloring and partitioning, cuts and connectivity, geometric problems, game theory and applications, network designandrouting,packingand covering,scheduling,designandanalysisofr- domized algorithms, randomized complexity theory, pseudorandomness and - randomization,random combinatorialstructures, randomwalks/Markovchains, expander graphs and randomness extractors, probabilistic proof systems, r- dom projections and embeddings, error-correcting codes, average-case analysis, property testing, computational learning theory, and other applications of - proximation and randomness. The volume contains 20 contributed papers selected by the APPROX P- gram Committee out of 50 submissions, and 21 contributed papers selected by the RANDOM Program Committee out of 51 submissions.
Publicado por Springer Berlin Heidelberg, 2005
ISBN 10: 3540282394 ISBN 13: 9783540282396
Idioma: Inglés
Librería: moluna, Greven, Alemania
EUR 48,37
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoKartoniert / Broschiert. Condición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 53,67
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 54,07
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 65,23
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 61,32
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 61,32
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 77,63
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 312.
Publicado por Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 2005, 2005
ISBN 10: 3540282394 ISBN 13: 9783540282396
Idioma: Inglés
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 53,49
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Neuware -volume contains 20 contributed papers selected by the APPROX P- gram Committee out of 50 submissions, and 21 contributed papers selected by the RANDOM Program Committee out of 51 submissions.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 512 pp. Englisch.
Publicado por Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 2001, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Idioma: Inglés
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 53,49
Convertir monedaCantidad 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.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 83,33
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 512.
Librería: Chiron Media, Wallingford, Reino Unido
EUR 77,88
Convertir monedaCantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 79,20
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 83,59
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: GuthrieBooks, Spring Branch, TX, Estados Unidos de America
EUR 41,78
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Except for library markings, interior clean and unmarked. Tight binding.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 52,49
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 52,89
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 112,77
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: dsmbooks, Liverpool, Reino Unido
EUR 98,41
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Like New. Like New. book.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 126,08
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: dsmbooks, Liverpool, Reino Unido
EUR 128,39
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Like New. Like New. book.
Publicado por Springer Berlin Heidelberg Aug 2001, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Idioma: Inglés
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 53,49
Convertir monedaCantidad 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.
Publicado por Springer Berlin Heidelberg Aug 2005, 2005
ISBN 10: 3540282394 ISBN 13: 9783540282396
Idioma: Inglés
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 53,49
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This volume contains the papers presented at the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2005) and the 9th International Workshop on Randomization and Computation(RANDOM2005),whichtookplaceconcurrentlyattheUniversity of California in Berkeley, on August 22 24, 2005. APPROX focuses on algori- mic and complexity issues surrounding the development of e cient approximate solutions to computationally hard problems, and APPROX 2005 was the eighth in the series after Aalborg (1998), Berkeley (1999), Saarbru cken (2000), Ber- ley (2001),Rome (2002),Princeton(2003),and Cambridge(2004).RANDOM is concerned with applications of randomness to computational and combinatorial problems, and RANDOM 2005 was the ninth workshop in the series foll- ing Bologna (1997), Barcelona (1998), Berkeley(1999), Geneva (2000), Berkeley (2001), Harvard (2002), Princeton (2003), and Cambridge (2004). Topics of interest for APPROX and RANDOM are: design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, mathematical programming methods, coloring and partitioning, cuts and connectivity, geometric problems, game theory and applications, network designandrouting,packingand covering,scheduling,designandanalysisofr- domized algorithms, randomized complexity theory, pseudorandomness and - randomization,random combinatorialstructures, randomwalks/Markovchains, expander graphs and randomness extractors, probabilistic proof systems, r- dom projections and embeddings, error-correcting codes, average-case analysis, property testing, computational learning theory, and other applications of - proximation and randomness. The volume contains 20 contributed papers selected by the APPROX P- gram Committee out of 50 submissions, and 21 contributed papers selected by the RANDOM Program Committee out of 51 submissions. 512 pp. Englisch.