Order Total (1 Item Items):
Shipping Destination:
Approximation Randomization Combinatorial Optimization Algorithms by Charikar Moses (24 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (24)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (18)
- As New, Fine or Near Fine (5)
- Very Good or Good (1)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
- All Bindings
- Hardcover (No further results match this refinement)
- Softcover (24)
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (11)
- Not Print on Demand (21)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
Paperback. Condition: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments.
-
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
-
Condition: 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.
-
Approximation, randomization, and combinatorial optimization. Algorithms and Techniques. 10th international workshop and 11th international workshop ; proceedings. APPROX 2007, RANDOM 2007, Princeton, NJ, USA, August 20 - 22, 2007. (=Lecture notes in computer science ; Vol. 4627).
Language: English
Published by Berlin, Springer, 2007
Seller: Antiquariat Thomas Haker GmbH & Co. KG, Berlin, Germany
Association Member: GIAQ
Seller rating 5 out of 5 stars
Paperback. Condition: Wie neu. XII, 626 S.; Ill. Like new. Shrink wrapped. Sprache: Englisch Gewicht in Gramm: 985.
-
Condition: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
-
Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
-
Condition: New. pp. 642.
-
Condition: New. pp. 642 Illus.
-
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
-
Condition: New. pp. 642.
-
Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
-
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 10th International Workshop, APPROX 2007, and 11th . Computer Science and General Issues) : 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings
Language: English
Published by Springer Berlin Heidelberg, 2007
ISBN 10: 3540742077 ISBN 13: 9783540742074
Taschenbuch. Condition: 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.
-
-
-
Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
£ 104.90
£ 15 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
£ 123.99
£ 15 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Paperback. Condition: Like New. Like New. book.
-
Taschenbuch. Condition: Neu. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings | Moses Charikar (u. a.) | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2007 | Springer | EAN 9783540742074 | Verantwortliche Person für die EU: Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, productsafety[at]springernature[dot]com | Anbieter: preigu.
-
Condition: As New. Unread book in perfect condition.
-
Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques
Language: English
Published by Springer-Verlag New York Inc, 2007
ISBN 10: 3540742077 ISBN 13: 9783540742074
Paperback. Condition: Brand New. 1st edition. 626 pages. 9.25x6.00x0.75 inches. In Stock.
-
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings
Language: English
Published by Springer Berlin Heidelberg, 2007
ISBN 10: 3540742077 ISBN 13: 9783540742074
Taschenbuch. Condition: 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.
-
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Language: English
Published by Springer Berlin Heidelberg Aug 2007, 2007
ISBN 10: 3540742077 ISBN 13: 9783540742074
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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.
-
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Language: English
Published by Springer Berlin Heidelberg, 2007
ISBN 10: 3540742077 ISBN 13: 9783540742074
Condition: 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.
-
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Language: English
Published by Springer, Springer Aug 2007, 2007
ISBN 10: 3540742077 ISBN 13: 9783540742074
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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.
