↓ Skip to main content

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Overview of attention for book
Cover of 'Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
  3. Altmetric Badge
    Chapter 2 Adaptive Sampling for k-Means Clustering
  4. Altmetric Badge
    Chapter 3 Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs
  5. Altmetric Badge
    Chapter 4 Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
  6. Altmetric Badge
    Chapter 5 Truthful Mechanisms via Greedy Iterative Packing
  7. Altmetric Badge
    Chapter 6 Resource Minimization Job Scheduling
  8. Altmetric Badge
    Chapter 7 The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
  9. Altmetric Badge
    Chapter 8 New Hardness Results for Diophantine Approximation
  10. Altmetric Badge
    Chapter 9 PASS Approximation
  11. Altmetric Badge
    Chapter 10 Optimal Sherali-Adams Gaps from Pairwise Independence
  12. Altmetric Badge
    Chapter 11 An Approximation Scheme for Terrain Guarding
  13. Altmetric Badge
    Chapter 13 Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
  14. Altmetric Badge
    Chapter 14 Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
  15. Altmetric Badge
    Chapter 15 On the Optimality of Gluing over Scales
  16. Altmetric Badge
    Chapter 16 On Hardness of Pricing Items for Single-Minded Bidders
  17. Altmetric Badge
    Chapter 17 Real-Time Message Routing and Scheduling
  18. Altmetric Badge
    Chapter 18 Approximating Some Network Design Problems with Node Costs
  19. Altmetric Badge
    Chapter 19 Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
  20. Altmetric Badge
    Chapter 20 Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy
  21. Altmetric Badge
    Chapter 21 Minimizing Average Shortest Path Distances via Shortcut Edge Addition
  22. Altmetric Badge
    Chapter 22 Approximating Node-Connectivity Augmentation Problems
  23. Altmetric Badge
    Chapter 23 A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
  24. Altmetric Badge
    Chapter 24 Approximation Algorithms for Domatic Partitions of Unit Disk Graphs
  25. Altmetric Badge
    Chapter 25 On the Complexity of the Asymmetric VPN Problem
  26. Altmetric Badge
    Chapter 26 Deterministic Approximation Algorithms for the Nearest Codeword Problem
  27. Altmetric Badge
    Chapter 27 Strong Parallel Repetition Theorem for Free Projection Games
  28. Altmetric Badge
    Chapter 28 Random Low Degree Polynomials are Hard to Approximate
  29. Altmetric Badge
    Chapter 29 Composition of Semi-LTCs by Two-Wise Tensor Products
  30. Altmetric Badge
    Chapter 30 On the Security of Goldreich’s One-Way Function
  31. Altmetric Badge
    Chapter 31 Random Tensors and Planted Cliques
  32. Altmetric Badge
    Chapter 32 Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry
  33. Altmetric Badge
    Chapter 33 Average-Case Analyses of Vickrey Costs
  34. Altmetric Badge
    Chapter 34 A Hypergraph Dictatorship Test with Perfect Completeness
  35. Altmetric Badge
    Chapter 35 Extractors Using Hardness Amplification
  36. Altmetric Badge
    Chapter 36 How Well Do Random Walks Parallelize?
  37. Altmetric Badge
    Chapter 37 An Analysis of Random-Walk Cuckoo Hashing
  38. Altmetric Badge
    Chapter 38 Hierarchy Theorems for Property Testing
  39. Altmetric Badge
    Chapter 39 Algorithmic Aspects of Property Testing in the Dense Graphs Model
  40. Altmetric Badge
    Chapter 40 Succinct Representation of Codes with Applications to Testing
  41. Altmetric Badge
    Chapter 41 Efficient Quantum Tensor Product Expanders and k-Designs
  42. Altmetric Badge
    Chapter 42 Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND
  43. Altmetric Badge
    Chapter 43 Pseudorandom Generators and Typically-Correct Derandomization
  44. Altmetric Badge
    Chapter 44 Baum’s Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions
  45. Altmetric Badge
    Chapter 45 Tolerant Linearity Testing and Locally Testable Codes
  46. Altmetric Badge
    Chapter 46 Pseudorandom Bit Generators That Fool Modular Sums
  47. Altmetric Badge
    Chapter 47 The Glauber Dynamics for Colourings of Bounded Degree Trees
  48. Altmetric Badge
    Chapter 48 Testing ±1-weight halfspace
  49. Altmetric Badge
    Chapter 49 Small-Bias Spaces for Group Products
  50. Altmetric Badge
    Chapter 50 Small Clique Detection and Approximate Nash Equilibria
  51. Altmetric Badge
    Chapter 51 Testing Computability by Width Two OBDDs
  52. Altmetric Badge
    Chapter 52 Improved Polynomial Identity Testing for Read-Once Formulas
  53. Altmetric Badge
    Chapter 53 Smooth analysis of the condition number and the least singular value
  54. Altmetric Badge
    Chapter 54 Erratum: Resource Minimization Job Scheduling
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • In the top 25% of all research outputs scored by Altmetric
  • High Attention Score compared to outputs of the same age (96th percentile)
  • High Attention Score compared to outputs of the same age and source (97th percentile)

Mentioned by

blogs
1 blog
wikipedia
1 Wikipedia page
q&a
5 Q&A threads

Citations

dimensions_citation
8 Dimensions

Readers on

mendeley
1 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Published by
ADS, January 2009
DOI 10.1007/978-3-642-03685-9
ISBNs
978-3-64-203684-2, 978-3-64-203685-9
Editors

Irit Dinur, Klaus Jansen, Joseph Naor, José Rolim

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 100%
Readers by discipline Count As %
Computer Science 1 100%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 25. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 04 September 2023.
All research outputs
#1,439,778
of 24,380,741 outputs
Outputs from ADS
#672
of 39,196 outputs
Outputs of similar age
#5,717
of 177,607 outputs
Outputs of similar age from ADS
#20
of 906 outputs
Altmetric has tracked 24,380,741 research outputs across all sources so far. Compared to these this one has done particularly well and is in the 94th percentile: it's in the top 10% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 39,196 research outputs from this source. They receive a mean Attention Score of 4.7. This one has done particularly well, scoring higher than 98% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 177,607 tracked outputs that were published within six weeks on either side of this one in any source. This one has done particularly well, scoring higher than 96% of its contemporaries.
We're also able to compare this research output to 906 others from the same source and published within six weeks on either side of this one. This one has done particularly well, scoring higher than 97% of its contemporaries.