Da: Doss-Haus Books, Redondo Beach, CA, U.S.A.
Hardcover. Condizione: 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].
Da: Universitätsbuchhandlung Herta Hold GmbH, Berlin, Germania
EUR 10,00
Quantità: 1 disponibili
Aggiungi al carrelloIX, 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.
Paperback. Condizione: Very Good. We are unable to ship to Canada at this time.Ex-library paperback in very nice condition with the usual markings and attachments. Except for library markings, interior clean and unmarked. Tight binding.
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New.
Condizione: New. SUPER FAST SHIPPING.
Condizione: New. SUPER FAST SHIPPING.
Condizione: As New. Unread book in perfect condition.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 57,44
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 57,44
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Chiron Media, Wallingford, Regno Unito
EUR 55,84
Quantità: 10 disponibili
Aggiungi al carrelloPF. Condizione: New.
Editore: Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Lingua: Inglese
Da: Rarewaves.com USA, London, LONDO, Regno Unito
EUR 75,38
Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback. Condizione: 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.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 57,43
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 57,43
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Condizione: New. pp. 312.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 65,21
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 512.
Da: online-buch-de, Dozwil, Svizzera
EUR 46,54
Quantità: 1 disponibili
Aggiungi al carrelloPaperback Jun 13, 2008. Condizione: gebraucht; wie neu. ungebraucht, evtl. minimalste Lagerspuren.
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 79,02
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Editore: Springer Berlin Heidelberg, 2005
ISBN 10: 3540282394 ISBN 13: 9783540282396
Lingua: Inglese
Da: moluna, Greven, Germania
EUR 48,37
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: CSG Onlinebuch GMBH, Darmstadt, Germania
EUR 14,88
Quantità: 1 disponibili
Aggiungi al carrelloSoftcover. Condizione: 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.
Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 2001, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Lingua: Inglese
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 53,49
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Editore: Springer Berlin Heidelberg, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 53,49
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Editore: Springer Berlin Heidelberg, 2005
ISBN 10: 3540282394 ISBN 13: 9783540282396
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 53,49
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Da: preigu, Osnabrück, Germania
EUR 50,35
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 8th International Workshop on Approximation Algorithms for Compinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings | Chandra Chekuri (u. a.) | Taschenbuch | xi | Englisch | 2005 | Springer | EAN 9783540282396 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Da: preigu, Osnabrück, Germania
EUR 50,35
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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-Verlag GmbH | EAN 9783540424703 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.