|Listed in category:
Have one to sell?

Approximation, Randomization and Combinatorial Optimization. Algorithms and Tech

US $124.35
No Interest if paid in full in 6 mo on $99+ with PayPal Credit*
Condition:
Brand New
3 available
Breathe easy. Returns accepted.
Shipping:
Free Economy Shipping. See detailsfor shipping
Located in: Fairfield, Ohio, United States
Delivery:
Estimated between Tue, Jul 9 and Fri, Jul 19 to 43230
Estimated delivery dates - opens in a new window or tab include seller's handling time, origin ZIP Code, destination ZIP Code and time of acceptance and will depend on shipping service selected and receipt of cleared paymentcleared payment - opens in a new window or tab. Delivery times may vary, especially during peak periods.
This item has an extended handling time and a delivery estimate greater than 11 business days.
Returns:
30 days returns. Buyer pays for return shipping. See details- for more information about returns
Payments:
      
*No Interest if paid in full in 6 months on $99+. See terms and apply now- for PayPal Credit, opens in a new window or tab
Earn up to 5x points when you use your eBay Mastercard®. Learn moreabout earning points with eBay Mastercard

Shop with confidence

eBay Money Back Guarantee
Get the item you ordered or your money back. Learn moreeBay Money Back Guarantee - opens new window or tab
Seller assumes all responsibility for this listing.
eBay item number:364686935938
Last updated on May 19, 2024 07:34:07 PDTView all revisionsView all revisions

Item specifics

Condition
Brand New: A new, unread, unused book in perfect condition with no missing or damaged pages. See the ...
ISBN-13
9783540853626
Book Title
Approximation, Randomization and Combinatorial Optimization. Algo
ISBN
9783540853626
Subject Area
Computers
Publication Name
Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques : 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 2008 - Proceeding
Publisher
Springer Berlin / Heidelberg
Item Length
9.3 in
Subject
Programming / General, Programming / Algorithms, Computer Science
Publication Year
2008
Series
Lecture Notes in Computer Science Ser.
Type
Textbook
Format
Trade Paperback
Language
English
Author
Klaus Jansen
Item Weight
33.1 Oz
Item Width
6.1 in
Number of Pages
Xii, 604 Pages

About this product

Product Information

This volume contains the papers presented at the 11th International Wo- shop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2008) and the 12th International Workshop on Randomization and Computation (RANDOM 2008), which took place concurrently at the MIT (M- sachusetts Institute of Technology) in Boston, USA, during August 25-27, 2008. APPROX focuses on algorithmic and complexity issues surrounding the development of e'cient approximate solutions to computationally di'cult problems, and was the 11th in the series after Aalborg (1998), Berkeley (1999), Saarbru ]cken (2000), Berkeley (2001), Rome (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), and Princeton (2007). RANDOM is concerned with applications of randomness to computational and combinatorial problems, and was the 12th workshop in the series following Bologna (1997), Barcelona (1998), Berkeley (1999), Geneva (2000), Berkeley (2001), Harvard (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), and Princeton (2007). Topics of interest for APPROX and RANDOM are: design and analysis of - proximation algorithms, hardness of approximation, small space, sub-linear time, streaming, algorithms, embeddings and metric space methods, mathematical programming methods, combinatorial problems in graphs and networks, game t- ory, markets, economic applications, geometric problems, packing, covering, scheduling, approximate learning, design and analysis of randomized algorithms, randomized complexity theory, pseudorandomness and derandomization, random combinatorial structures, random walks/Markov chains, expander graphs and randomness extractors, probabilistic proof systems, random projections and - beddings, error-correcting codes, average-case analysis, property testing, com- tational learning theory, and other applications of approximation and randomness.

Product Identifiers

Publisher
Springer Berlin / Heidelberg
ISBN-10
3540853626
ISBN-13
9783540853626
eBay Product ID (ePID)
70899752

Product Key Features

Number of Pages
Xii, 604 Pages
Language
English
Publication Name
Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques : 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 2008 - Proceeding
Publication Year
2008
Subject
Programming / General, Programming / Algorithms, Computer Science
Type
Textbook
Subject Area
Computers
Author
Klaus Jansen
Series
Lecture Notes in Computer Science Ser.
Format
Trade Paperback

Dimensions

Item Weight
33.1 Oz
Item Length
9.3 in
Item Width
6.1 in

Additional Product Features

Intended Audience
Scholarly & Professional
Series Volume Number
5171
Number of Volumes
1 Vol.
Illustrated
Yes
Lc Classification Number
Qa76.6-76.66
Table of Content
Contributed Talks of APPROX.- Approximating Optimal Binary Decision Trees.- Santa Claus Meets Hypergraph Matchings.- Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction.- Connected Vertex Covers in Dense Graphs.- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies.- Sweeping Points.- Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness.- Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks.- Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP.- Approximating Maximum Subgraphs without Short Cycles.- Deterministic 7/8-Approximation for the Metric Maximum TSP.- Inapproximability of Survivable Networks.- Approximating Single Machine Scheduling with Scenarios.- Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity.- A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One.- The Directed Minimum Latency Problem.- A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem.- Approximating Directed Weighted-Degree Constrained Networks.- A Constant Factor Approximation for Minimum ?-Edge-Connected k-Subgraph with Metric Costs.- Budgeted Allocations in the Full-Information Setting.- Contributed Talks of RANDOM.- Optimal Random Matchings on Trees and Applications.- Small Sample Spaces Cannot Fool Low Degree Polynomials.- Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size.- Tensor Products of Weakly Smooth Codes Are Robust.- On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs.- Improved Bounds for Testing Juntas.- The Complexity of Distinguishing MarkovRandom Fields.- Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms.- Tight Bounds for Hashing Block Sources.- Improved Separations between Nondeterministic and Randomized Multiparty Communication.- Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs.- On the Query Complexity of Testing Orientations for Being Eulerian.- Approximately Counting Embeddings into Random Graphs.- Increasing the Output Length of Zero-Error Dispersers.- Euclidean Sections of with Sublinear Randomness and Error-Correction over the Reals.- The Complexity of Local List Decoding.- Limitations of Hardness vs. Randomness under Uniform Reductions.- Learning Random Monotone DNF.- Breaking the ?-Soundness Bound of the Linearity Test over GF(2).- Dense Fast Random Projections and Lean Walsh Transforms.- Near Optimal Dimensionality Reductions That Preserve Volumes.- Sampling Hypersurfaces through Diffusion.- A 2-Source Almost-Extractor for Linear Entropy.- Extractors for Three Uneven-Length Sources.- The Power of Choice in a Generalized Pólya Urn Model.- Corruption and Recovery-Efficient Locally Decodable Codes.- Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets.
Copyright Date
2008

Item description from the seller

grandeagleretail

grandeagleretail

98.3% positive feedback
2.7M items sold
Joined Sep 2010
Usually responds within 24 hours

Detailed seller ratings

Average for the last 12 months

Accurate description
4.9
Reasonable shipping cost
5.0
Shipping speed
4.9
Communication
4.9

Seller feedback (1,025,668)

i***6 (139)- Feedback left by buyer.
Past 6 months
Verified purchase
Item as described, good price, well packaged, arrived slightly later than hoped (not in time for Christmas ) but the order was placed in a very busy shipping period. No issue with the seller’s speed of response and sending the item. Great seller!
l***a (3517)- Feedback left by buyer.
Past month
Verified purchase
Excellent seller. Timely shipping, safe packing, good communication, great price and as described. Thank you. A+++
o***b (144)- Feedback left by buyer.
Past month
Verified purchase
The seller is one of the best there is - high quality books, reasonable prices, securely packaged. I do, however, recommend some changes to their shipping - they show a shipper (SortHub) on eBay, but the tracking # they email is for a different carrier. It’s difficult to know where my purchase is. This time, it was delivered a week late. In the grand scheme of things not a big deal. But it shouldn’t be this difficult to accurately track my purchase.

Product ratings and reviews

No ratings or reviews yet
Be the first to write the review.