Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 59,99
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Sprache: Englisch
Verlag: Springer-Verlag New York Inc, 2012
ISBN 10: 3642325114 ISBN 13: 9783642325113
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 83,39
Anzahl: 2 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. 2012 edition. 674 pages. 9.00x6.00x1.50 inches. In Stock.
Sprache: Englisch
Verlag: Springer Berlin Heidelberg, 2012
ISBN 10: 3642325114 ISBN 13: 9783642325113
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the joint refereed proceedings of the 15th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2012, and the 16th International Workshop on Randomization and Computation, RANDOM 2012, held in Cambridge, Massachusetts, USA, in August 2011.The volume contains 28 contributed papers, selected by the APPROX Program Committee out of 70 submissions, and 28 contributed papers, selected by the RANDOM Program Committee out of 67 submissions.APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.
Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 692 | Sprache: Englisch | Produktart: Bücher | This book constitutes the joint refereed proceedings of the 15th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2012, and the 16th International Workshop on Randomization and Computation, RANDOM 2012, held in Cambridge, Massachusetts, USA, in August 2011. The volume contains 28 contributed papers, selected by the APPROX Program Committee out of 70 submissions, and 28 contributed papers, selected by the RANDOM Program Committee out of 67 submissions.APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.