↓ 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 Finding Small Holes
  3. Altmetric Badge
    Chapter 2 Approximate Range Searching: The Absolute Model
  4. Altmetric Badge
    Chapter 3 Orthogonal Range Searching in Linear and Almost-Linear Space
  5. Altmetric Badge
    Chapter 4 Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere
  6. Altmetric Badge
    Chapter 5 A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity
  7. Altmetric Badge
    Chapter 6 Approximating the Maximum Sharing Problem
  8. Altmetric Badge
    Chapter 7 The Stackelberg Minimum Spanning Tree Game
  9. Altmetric Badge
    Chapter 8 Edges and Switches, Tunnels and Bridges
  10. Altmetric Badge
    Chapter 9 How to Draw a Clustered Tree
  11. Altmetric Badge
    Chapter 10 Drawing Colored Graphs on Colored Points
  12. Altmetric Badge
    Chapter 11 Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric
  13. Altmetric Badge
    Chapter 12 Priority Queues Resilient to Memory Faults
  14. Altmetric Badge
    Chapter 13 Simple and Space-Efficient Minimal Perfect Hash Functions
  15. Altmetric Badge
    Chapter 14 A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane
  16. Altmetric Badge
    Chapter 15 A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems
  17. Altmetric Badge
    Chapter 16 Optimization for First Order Delaunay Triangulations
  18. Altmetric Badge
    Chapter 17 Constant Factor Approximations for the Hotlink Assignment Problem
  19. Altmetric Badge
    Chapter 18 Approximation Algorithms for the Sex-Equal Stable Marriage Problem
  20. Altmetric Badge
    Chapter 19 A Stab at Approximating Minimum Subadditive Join
  21. Altmetric Badge
    Chapter 20 Algorithmic Challenges for Systems-Level Correlational Analysis: A Tale of Two Datasets
  22. Altmetric Badge
    Chapter 21 Flooding Countries and Destroying Dams
  23. Altmetric Badge
    Chapter 22 I/O-Efficient Flow Modeling on Fat Terrains
  24. Altmetric Badge
    Chapter 23 Computing the Visibility Map of Fat Objects
  25. Altmetric Badge
    Chapter 24 Independent Sets in Bounded-Degree Hypergraphs
  26. Altmetric Badge
    Chapter 25 Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon
  27. Altmetric Badge
    Chapter 26 Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time
  28. Altmetric Badge
    Chapter 27 On a Family of Strong Geometric Spanners That Admit Local Routing Strategies
  29. Altmetric Badge
    Chapter 28 Spanners for Geometric Intersection Graphs
  30. Altmetric Badge
    Chapter 29 On Generalized Diamond Spanners
  31. Altmetric Badge
    Chapter 30 The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces
  32. Altmetric Badge
    Chapter 31 On the Robustness of Graham’s Algorithm for Online Scheduling
  33. Altmetric Badge
    Chapter 32 Improved Results for a Memory Allocation Problem
  34. Altmetric Badge
    Chapter 33 Computational and Structural Advantages of Circular Boundary Representation
  35. Altmetric Badge
    Chapter 34 Algorithms and Data Structures
  36. Altmetric Badge
    Chapter 35 Cauchy’s Theorem and Edge Lengths of Convex Polyhedra
  37. Altmetric Badge
    Chapter 36 Fixed-Parameter Tractability for Non-Crossing Spanning Trees
  38. Altmetric Badge
    Chapter 37 Improved Algorithms for the Feedback Vertex Set Problems
  39. Altmetric Badge
    Chapter 38 Kernelization Algorithms for d-Hitting Set Problems
  40. Altmetric Badge
    Chapter 39 Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points
  41. Altmetric Badge
    Chapter 40 Maximizing Maximal Angles for Plane Straight-Line Graphs
  42. Altmetric Badge
    Chapter 41 Cuttings for Disks and Axis-Aligned Rectangles
  43. Altmetric Badge
    Chapter 42 Kernelization and Complexity Results for Connectivity Augmentation Problems
  44. Altmetric Badge
    Chapter 43 An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
  45. Altmetric Badge
    Chapter 44 Branch and Recharge: Exact Algorithms for Generalized Domination
  46. Altmetric Badge
    Chapter 45 On Computing the Centroid of the Vertices of an Arrangement and Related Problems
  47. Altmetric Badge
    Chapter 46 Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p
  48. Altmetric Badge
    Chapter 47 Faster Approximation of Distances in Graphs
  49. Altmetric Badge
    Chapter 48 Approximate Shortest Paths Guided by a Small Index
  50. Altmetric Badge
    Chapter 49 Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model
  51. Altmetric Badge
    Chapter 50 Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field
  52. Altmetric Badge
    Chapter 51 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality
  53. Altmetric Badge
    Chapter 52 On Euclidean Vehicle Routing with Allocation
  54. Altmetric Badge
    Chapter 53 Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets
  55. Altmetric Badge
    Chapter 54 Range Non-overlapping Indexing and Successive List Indexing
  56. Altmetric Badge
    Chapter 55 Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton’s Identities and Invertible Bloom Filters
  57. Altmetric Badge
    Chapter 56 Dynamic TCP Acknowledgment with Sliding Window
Attention for Chapter 15: A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems
Altmetric Badge

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
7 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
A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems
Chapter number 15
Book title
Algorithms and Data Structures
Published by
Springer Berlin Heidelberg, August 2007
DOI 10.1007/978-3-540-73951-7_15
Book ISBNs
978-3-54-073948-7, 978-3-54-073951-7
Authors

Ajay Deshpande, Taejung Kim, Erik D. Demaine, Sanjay E. Sarma

Editors

Frank Dehne, Jörg-Rüdiger Sack, Norbert Zeh

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 %
Student > Ph. D. Student 4 57%
Researcher 2 29%
Other 1 14%
Student > Master 1 14%
Readers by discipline Count As %
Computer Science 6 86%
Arts and Humanities 1 14%