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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: Doss-Haus Books, Redondo Beach, CA, Estados Unidos de America
Hardcover. 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]. Nº de ref. del artículo: 010803
Cantidad disponible: 1 disponibles
Librería: Universitätsbuchhandlung Herta Hold GmbH, Berlin, Alemania
IX, 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. Nº de ref. del artículo: 651EB
Cantidad disponible: 1 disponibles
Librería: GoldBooks, Denver, CO, Estados Unidos de America
Condición: new. Nº de ref. del artículo: 57Y61_36_3540424709
Cantidad disponible: 1 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 916098-n
Cantidad disponible: Más de 20 disponibles
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020167107
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 916098
Cantidad disponible: Más de 20 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9783540424703_new
Cantidad disponible: Más de 20 disponibles
Librería: Chiron Media, Wallingford, Reino Unido
PF. Condición: New. Nº de ref. del artículo: 6666-IUK-9783540424703
Cantidad disponible: 10 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: New. Nº de ref. del artículo: 916098-n
Cantidad disponible: Más de 20 disponibles
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
Paperback. Condición: New. 2001 ed. 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. Nº de ref. del artículo: LU-9783540424703
Cantidad disponible: Más de 20 disponibles