Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques: 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008 / Edition 1

Paperback (Print)
Buy New
Buy New from
Used and New from Other Sellers
Used and New from Other Sellers
from $68.24
Usually ships in 1-2 business days
(Save 54%)
Other sellers (Paperback)
  • All (11) from $68.24   
  • New (7) from $93.05   
  • Used (4) from $68.24   

More About This Textbook


This book constitutes the joint refereed proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and the 12th International Workshop on Randomization and Computation, RANDOM 2008, held in Boston, MA, USA, in August 2008.

The 20 revised full papers of the APPROX 2008 workshop were carefully reviewed and selected from 42 submissions and focus on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM 2008 is concerned with applications of randomness to computational and combinatorial problems and accounts for 27 revised full papers, also diligently reviewed and selected out of 52 workshop submissions.

Read More Show Less

Product Details

Table of Contents

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 Markov Random 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.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)