↓ Skip to main content

Algorithms and Data Structures

Overview of attention for book
Cover of 'Algorithms and Data Structures'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 On the Power of the Semi-Separated Pair Decomposition
  3. Altmetric Badge
    Chapter 2 Plane Graphs with Parity Constraints
  4. Altmetric Badge
    Chapter 3 Straight-Line Rectangular Drawings of Clustered Graphs
  5. Altmetric Badge
    Chapter 4 Online Priority Steiner Tree Problems
  6. Altmetric Badge
    Chapter 5 Connect the Dot: Computing Feed-Links with Minimum Dilation
  7. Altmetric Badge
    Chapter 6 Minimal Locked Trees
  8. Altmetric Badge
    Chapter 7 Approximating Transitive Reductions for Directed Networks
  9. Altmetric Badge
    Chapter 8 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2
  10. Altmetric Badge
    Chapter 9 Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
  11. Altmetric Badge
    Chapter 10 A Distribution-Sensitive Dictionary with Low Space Overhead
  12. Altmetric Badge
    Chapter 11 A Comparison of Performance Measures for Online Algorithms
  13. Altmetric Badge
    Chapter 12 Delaunay Triangulation of Imprecise Points Simplified and Extended
  14. Altmetric Badge
    Chapter 13 An Improved SAT Algorithm in Terms of Formula Length
  15. Altmetric Badge
    Chapter 14 Shortest Path Problems on a Polyhedral Surface
  16. Altmetric Badge
    Chapter 15 Approximation Algorithms for Buy-at-Bulk Geometric Network Design
  17. Altmetric Badge
    Chapter 16 Rank-Sensitive Priority Queues
  18. Altmetric Badge
    Chapter 17 Algorithms Meet Art, Puzzles, and Magic
  19. Altmetric Badge
    Chapter 18 Skip-Splay: Toward Achieving the Unified Bound in the BST Model
  20. Altmetric Badge
    Chapter 19 Drawing Graphs with Right Angle Crossings
  21. Altmetric Badge
    Chapter 20 Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance
  22. Altmetric Badge
    Chapter 21 Efficient Construction of Near-Optimal Binary and Multiway Search Trees
  23. Altmetric Badge
    Chapter 22 On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
  24. Altmetric Badge
    Chapter 23 On Reconfiguration of Disks in the Plane and Related Problems
  25. Altmetric Badge
    Chapter 24 Orientation-Constrained Rectangular Layouts
  26. Altmetric Badge
    Chapter 25 The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
  27. Altmetric Badge
    Chapter 26 Optimal Embedding into Star Metrics
  28. Altmetric Badge
    Chapter 27 Online Square Packing
  29. Altmetric Badge
    Chapter 28 Worst-Case Optimal Adaptive Prefix Coding
  30. Altmetric Badge
    Chapter 29 New Results on Visibility in Simple Polygons
  31. Altmetric Badge
    Chapter 30 Dynamic Graph Clustering Using Minimum-Cut Trees
  32. Altmetric Badge
    Chapter 31 Rank-Balanced Trees
  33. Altmetric Badge
    Chapter 32 Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments
  34. Altmetric Badge
    Chapter 33 Reconfiguration of List Edge-Colorings in a Graph
  35. Altmetric Badge
    Chapter 34 The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
  36. Altmetric Badge
    Chapter 35 Two for One: Tight Approximation of 2D Bin Packing
  37. Altmetric Badge
    Chapter 36 Fault Tolerant External Memory Algorithms
  38. Altmetric Badge
    Chapter 37 Inspecting a Set of Strips Optimally
  39. Altmetric Badge
    Chapter 38 A Pseudopolynomial Algorithm for Alexandrov’s Theorem
  40. Altmetric Badge
    Chapter 39 A Scheme for Computing Minimum Covers within Simple Regions
  41. Altmetric Badge
    Chapter 40 Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem
  42. Altmetric Badge
    Chapter 41 Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality
  43. Altmetric Badge
    Chapter 42 Streaming Embeddings with Slack
  44. Altmetric Badge
    Chapter 43 Computing the Implicit Voronoi Diagram in Triple Precision
  45. Altmetric Badge
    Chapter 44 Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
  46. Altmetric Badge
    Chapter 45 Integer Programming: Optimization and Evaluation Are Equivalent
  47. Altmetric Badge
    Chapter 46 Resolving Loads with Positive Interior Stresses
  48. Altmetric Badge
    Chapter 47 On Making Directed Graphs Transitive
  49. Altmetric Badge
    Chapter 48 Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
  50. Altmetric Badge
    Chapter 49 Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
Attention for Chapter 8: 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2
Altmetric Badge

About this Attention Score

  • Above-average Attention Score compared to outputs of the same age and source (55th percentile)

Mentioned by

wikipedia
4 Wikipedia pages

Readers on

mendeley
12 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.
Chapter title
1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2
Chapter number 8
Book title
Algorithms and Data Structures
Published in
Lecture notes in computer science, August 2009
DOI 10.1007/978-3-642-03367-4_8
Book ISBNs
978-3-64-203366-7, 978-3-64-203367-4
Authors

Piotr Berman, Marek Karpinski, Alexander Zelikovsky

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 12 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 4 33%
Professor > Associate Professor 2 17%
Student > Ph. D. Student 2 17%
Unspecified 1 8%
Researcher 1 8%
Other 1 8%
Unknown 1 8%
Readers by discipline Count As %
Computer Science 6 50%
Unspecified 1 8%
Mathematics 1 8%
Biochemistry, Genetics and Molecular Biology 1 8%
Business, Management and Accounting 1 8%
Other 1 8%
Unknown 1 8%
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 19 October 2023.
All research outputs
#7,452,489
of 22,783,848 outputs
Outputs from Lecture notes in computer science
#2,485
of 8,124 outputs
Outputs of similar age
#36,091
of 105,896 outputs
Outputs of similar age from Lecture notes in computer science
#9
of 38 outputs
Altmetric has tracked 22,783,848 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,124 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 105,896 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 19th percentile – i.e., 19% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 38 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 55% of its contemporaries.