↓ Skip to main content

Randomization and Approximation Techniques in Computer Science

Overview of attention for book
Cover of 'Randomization and Approximation Techniques in Computer Science'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Polynomial time approximation schemes for some dense instances of NP-hard optimization problems
  3. Altmetric Badge
    Chapter 2 Average-case complexity of shortest-paths problems in the vertex-potential model
  4. Altmetric Badge
    Chapter 3 Approximation algorithms for covering polygons with squares and similar problems
  5. Altmetric Badge
    Chapter 4 Greedily approximating the r -independent set and k -center problems on random instances
  6. Altmetric Badge
    Chapter 5 Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
  7. Altmetric Badge
    Chapter 6 Random sampling of Euler tours
  8. Altmetric Badge
    Chapter 7 A combinatorial consistency lemma with application to proving the PCP theorem
  9. Altmetric Badge
    Chapter 8 Super-bits, demi-bits, and NP/qpoly-natural proofs
  10. Altmetric Badge
    Chapter 9 Sample spaces with small bias on neighborhoods and error-correcting communication protocols
  11. Altmetric Badge
    Chapter 10 Approximation on the web: A compendium of NP optimization problems
  12. Altmetric Badge
    Chapter 11 Random-based scheduling new approximations and LP lower bounds
  13. Altmetric Badge
    Chapter 12 ‘Go with the winners’ generators with applications to molecular modeling
  14. Altmetric Badge
    Chapter 13 Probabilistic approximation of some NP optimization problems by finite-state machines
  15. Altmetric Badge
    Chapter 14 Using hard problems to derandomize algorithms: An incomplete survey
  16. Altmetric Badge
    Chapter 15 Weak and strong recognition by 2-way randomized automata
  17. Altmetric Badge
    Chapter 16 Tally languages accepted by Monte Carlo pushdown automata
  18. Altmetric Badge
    Chapter 17 Resource-bounded randomness and compressibility with respect to nonuniform measures
  19. Altmetric Badge
    Chapter 18 Randomness, stochasticity and approximations
Attention for Chapter 3: Approximation algorithms for covering polygons with squares and similar problems
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
7 Mendeley
citeulike
1 CiteULike
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.
Chapter title
Approximation algorithms for covering polygons with squares and similar problems
Chapter number 3
Book title
Randomization and Approximation Techniques in Computer Science
Published in
Lecture notes in computer science, July 1997
DOI 10.1007/3-540-63248-4_3
Book ISBNs
978-3-54-063248-1, 978-3-54-069247-8
Authors

Christos Levcopoulos, Joachim Gudmundsson

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 7 100%

Demographic breakdown

Readers by professional status Count As %
Professor > Associate Professor 2 29%
Student > Ph. D. Student 2 29%
Student > Master 1 14%
Researcher 1 14%
Other 1 14%
Other 0 0%
Readers by discipline Count As %
Computer Science 4 57%
Engineering 2 29%
Mathematics 1 14%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. 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 13 June 2014.
All research outputs
#7,454,951
of 22,790,780 outputs
Outputs from Lecture notes in computer science
#2,487
of 8,127 outputs
Outputs of similar age
#9,424
of 29,721 outputs
Outputs of similar age from Lecture notes in computer science
#2
of 7 outputs
Altmetric has tracked 22,790,780 research outputs across all sources so far. This one is in the 44th percentile – i.e., 44% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,127 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 55% 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 29,721 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 8th percentile – i.e., 8% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 7 others from the same source and published within six weeks on either side of this one. This one has scored higher than 5 of them.