↓ 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 Correlation Clustering with Partial Information
  3. Altmetric Badge
    Chapter 2 Improved Linear Time Approximation Algorithms for Weighted Matchings
  4. Altmetric Badge
    Chapter 3 Covering Graphs Using Trees and Stars
  5. Altmetric Badge
    Chapter 4 An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor
  6. Altmetric Badge
    Chapter 5 Approximation Algorithms for Channel Allocation Problems in Broadcast Networks
  7. Altmetric Badge
    Chapter 6 Asymmetry in k -Center Variants
  8. Altmetric Badge
    Chapter 7 An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
  9. Altmetric Badge
    Chapter 8 On the Complexity of Approximating k -Dimensional Matching
  10. Altmetric Badge
    Chapter 9 Approximating Market Equilibria
  11. Altmetric Badge
    Chapter 10 Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
  12. Altmetric Badge
    Chapter 11 On the Hardness of Approximate Multivariate Integration
  13. Altmetric Badge
    Chapter 12 A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem
  14. Altmetric Badge
    Chapter 13 Approximating Rooted Connectivity Augmentation Problems
  15. Altmetric Badge
    Chapter 14 Effective Routing and Scheduling in Adversarial Queueing Networks
  16. Altmetric Badge
    Chapter 15 Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement
  17. Altmetric Badge
    Chapter 16 An Improved Algorithm for Approximating the Radii of Point Sets
  18. Altmetric Badge
    Chapter 17 Testing Low-Degree Polynomials over GF (2)
  19. Altmetric Badge
    Chapter 18 Computational Analogues of Entropy
  20. Altmetric Badge
    Chapter 19 Bounds on 2-Query Codeword Testing
  21. Altmetric Badge
    Chapter 20 The Lovász Number of Random Graphs
  22. Altmetric Badge
    Chapter 21 Perfectly Balanced Allocation
  23. Altmetric Badge
    Chapter 22 On Extracting Private Randomness over a Public Channel
  24. Altmetric Badge
    Chapter 23 High Degree Vertices and Eigenvalues in the Preferential Attachment Graph
  25. Altmetric Badge
    Chapter 24 The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems
  26. Altmetric Badge
    Chapter 25 Continuous-Time Quantum Walks on the Symmetric Group
  27. Altmetric Badge
    Chapter 26 Distribution-Free Property Testing
  28. Altmetric Badge
    Chapter 27 On the Graph-Density of Random 0/1-Polytopes
  29. Altmetric Badge
    Chapter 28 A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding
  30. Altmetric Badge
    Chapter 29 Tight Bounds for Testing Bipartiteness in General Graphs
  31. Altmetric Badge
    Chapter 30 Discrete Quantum Walks Hit Exponentially Faster
  32. Altmetric Badge
    Chapter 31 Approximate Testing of Visual Properties
  33. Altmetric Badge
    Chapter 32 Faster Algorithms for MAX CUT and MAX CSP , with Polynomial Expected Time for Sparse Instances
  34. Altmetric Badge
    Chapter 33 A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries
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 (82nd percentile)
  • High Attention Score compared to outputs of the same age and source (93rd percentile)

Mentioned by

1 blog
1 Wikipedia page


4 Dimensions

Readers on

59 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.
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
Published by
Lecture notes in computer science, January 2003
DOI 10.1007/b11961
978-3-54-040770-6, 978-3-54-045198-3

Sanjeev Arora, Klaus Jansen, José D. P. Rolim, Amit Sahai


Arora, Sanjeev, Jansen, Klaus, Rolim, José D. P., Sahai, Amit

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 59 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 2%
Unknown 58 98%
Readers by discipline Count As %
Computer Science 1 2%
Unknown 58 98%

Attention Score in Context

This research output has an Altmetric Attention Score of 9. 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 19 May 2014.
All research outputs
of 12,364,412 outputs
Outputs from Lecture notes in computer science
of 7,243 outputs
Outputs of similar age
of 239,754 outputs
Outputs of similar age from Lecture notes in computer science
of 282 outputs
Altmetric has tracked 12,364,412 research outputs across all sources so far. Compared to these this one has done well and is in the 86th percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 7,243 research outputs from this source. They receive a mean Attention Score of 4.4. This one has done particularly well, scoring higher than 91% 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 239,754 tracked outputs that were published within six weeks on either side of this one in any source. This one has done well, scoring higher than 82% of its contemporaries.
We're also able to compare this research output to 282 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 93% of its contemporaries.