Paperback. Condizione: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments.
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Da: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Condizione: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Lingua: Inglese
Editore: Berlin, Springer, 2007
Da: Antiquariat Thomas Haker GmbH & Co. KG, Berlin, Germania
Membro dell'associazione: GIAQ
EUR 9,00
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Wie neu. XII, 626 S.; Ill. Like new. Shrink wrapped. Sprache: Englisch Gewicht in Gramm: 985.
Da: SMASS Sellers, IRVING, TX, U.S.A.
Condizione: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
Da: ALLBOOKS1, Direk, SA, Australia
EUR 40,23
Quantità: 1 disponibili
Aggiungi al carrelloBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 642.
Da: Majestic Books, Hounslow, Regno Unito
EUR 48,80
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. pp. 642 Illus.
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 51,70
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. pp. 642.
Da: ALLBOOKS1, Direk, SA, Australia
EUR 71,67
Quantità: 1 disponibili
Aggiungi al carrelloBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 2007
ISBN 10: 3540742077 ISBN 13: 9783540742074
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 31,82
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Sehr gut. Gebraucht - Sehr gut Sg - Ungelesenes Mängelexemplar mit leichten Lagerspuren, Sofortversand - This volume presents the refereed proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and the 11th International Workshop on Randomization and Computation. The papers cover design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, and much more.
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New.
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 103,72
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 111,90
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 111,89
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 147,13
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 137,65
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Like New. Like New. book.
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Springer-Verlag New York Inc, 2007
ISBN 10: 3540742077 ISBN 13: 9783540742074
Da: Revaluation Books, Exeter, Regno Unito
EUR 157,00
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 1st edition. 626 pages. 9.25x6.00x0.75 inches. In Stock.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 2007
ISBN 10: 3540742077 ISBN 13: 9783540742074
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 106,99
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume presents the refereed proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and the 11th International Workshop on Randomization and Computation. The papers cover design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, and much more.
Lingua: Inglese
Editore: Springer Berlin Heidelberg Aug 2007, 2007
ISBN 10: 3540742077 ISBN 13: 9783540742074
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 106,99
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This volume presents the refereed proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and the 11th International Workshop on Randomization and Computation. The papers cover design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, and much more. 640 pp. Englisch.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 2007
ISBN 10: 3540742077 ISBN 13: 9783540742074
Da: moluna, Greven, Germania
EUR 92,27
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Presents the proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and the 11th International Workshop on Randomization and ComputationIncludes 44 full papers presenting some of the late.
Lingua: Inglese
Editore: Springer, Springer Aug 2007, 2007
ISBN 10: 3540742077 ISBN 13: 9783540742074
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 106,99
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Contributed Talks of APPROX.- Approximation Algorithms and Hardness for Domination with Propagation.- A Knapsack Secretary Problem with Applications.- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem.- Improved Approximation Algorithms for the Spanning Star Forest Problem.- Packing and Covering -Hyperbolic Spaces by Balls.- Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems.- Two Randomized Mechanisms for Combinatorial Auctions.- Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs.- Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows.- Stochastic Steiner Tree with Non-uniform Inflation.- On the Approximation Resistance of a Random Predicate.- Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to 1 Embeddability of Negative Type Metrics.- Optimal Resource Augmentations for Online Knapsack.- Soft Edge Coloring.- Approximation Algorithms for the Max-Min Allocation Problem.- Hardness of Embedding Metric Spaces of Equal Size.- Coarse Differentiation and Multi-flows in Planar Graphs.- Maximum Gradient Embeddings and Monotone Clustering.- Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems.- Encouraging Cooperation in Sharing Supermodular Costs.- Almost Exact Matchings.- Contributed Talks of RANDOM.- On Approximating the Average Distance Between Points.- On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR.- A Sequential Algorithm for Generating Random Graphs.- Local Limit Theorems for the Giant Component of Random Hypergraphs.- Derandomization of Euclidean Random Walks.- High Entropy Random Selection Protocols.- Testingst-Connectivity.- Properly 2-Colouring Linear Hypergraphs.- Random Subsets of the Interval and P2P Protocols.- The Cover Time of Random Digraphs.- Eigenvectors of Random Graphs: Nodal Domains.- Lower Bounds for Swapping Arthur and Merlin.- Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects.- On Estimating Frequency Moments of Data Streams.- Distribution-Free Testing Lower Bounds for Basic Boolean Functions.- On the Randomness Complexity of Property Testing.- On the Benefits of Adaptivity in Property Testing of Dense Graphs.- Slow Mixing of Markov Chains Using Fault Lines and Fat Contours.- Better Binary List-Decodable Codes Via Multilevel Concatenation.- Worst-Case to Average-Case Reductions Revisited.- On Finding Frequent Elements in a Data Stream.- Implementing Huge Sparse Random Graphs.- Sublinear Algorithms for Approximating String Compressibility.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 640 pp. Englisch.