↓ 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 229 Computing the all-pairs longest chains in the plane
  3. Altmetric Badge
    Chapter 230 Towards a better understanding of pure packet routing
  4. Altmetric Badge
    Chapter 231 Tolerating faults in meshes and other networks
  5. Altmetric Badge
    Chapter 232 A generalization of binary search
  6. Altmetric Badge
    Chapter 233 Groups and algebraic complexity
  7. Altmetric Badge
    Chapter 234 Connected component and simple polygon intersection searching
  8. Altmetric Badge
    Chapter 235 An optimal algorithm for finding the separation of simple polygons
  9. Altmetric Badge
    Chapter 236 Balanced search trees made simple
  10. Altmetric Badge
    Chapter 237 Probing a set of hyperplanes by lines and related problems
  11. Altmetric Badge
    Chapter 238 A general lower bound on the I/O-complexity of comparison-based algorithms
  12. Altmetric Badge
    Chapter 239 Point probe decision trees for geometric concept classes
  13. Altmetric Badge
    Chapter 240 A dynamic separator algorithm
  14. Altmetric Badge
    Chapter 241 Online load balancing of temporary tasks
  15. Altmetric Badge
    Chapter 242 Connected domination and steiner set on asteroidal triple-free graphs
  16. Altmetric Badge
    Chapter 243 The complexity of finding certain trees in tournaments
  17. Altmetric Badge
    Chapter 244 Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)
  18. Altmetric Badge
    Chapter 245 Separating the power of EREW and CREW PRAMs with small communication width
  19. Altmetric Badge
    Chapter 246 Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs
  20. Altmetric Badge
    Chapter 247 Parallel construction of quadtrees and quality triangulations
  21. Altmetric Badge
    Chapter 248 Pattern matching for permutations
  22. Altmetric Badge
    Chapter 249 Filling polyhedral molds
  23. Altmetric Badge
    Chapter 250 Deferred-query—An efficient approach for problems on interval and circular-arc graphs
  24. Altmetric Badge
    Chapter 251 On the complexity of graph embeddings
  25. Altmetric Badge
    Chapter 252 Algorithms for polytope covering and approximation
  26. Altmetric Badge
    Chapter 253 Global strategies for augmenting the efficiency of TSP heuristics
  27. Altmetric Badge
    Chapter 254 Static and dynamic algorithms for k -point clustering problems
  28. Altmetric Badge
    Chapter 255 Scalable algorithms for bichromatic line segment intersection problems on Coarse Grained Multicomputers
  29. Altmetric Badge
    Chapter 256 Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract)
  30. Altmetric Badge
    Chapter 257 The K -D heap: An efficient multi-dimensional priority queue
  31. Altmetric Badge
    Chapter 258 A complete and efficient algorithm for the intersection of a general and a convex polyhedron
  32. Altmetric Badge
    Chapter 259 Computing the smallest k -enclosing circle and related problems
  33. Altmetric Badge
    Chapter 260 An index data structure for matrices, with applications to fast two-dimensional pattern matching
  34. Altmetric Badge
    Chapter 261 A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects
  35. Altmetric Badge
    Chapter 262 Further results on generalized intersection searching problems: Counting, reporting, and dynamization
  36. Altmetric Badge
    Chapter 263 Generalized approximate algorithms for point set congruence
  37. Altmetric Badge
    Chapter 264 Approximating shortest superstrings with constraints
  38. Altmetric Badge
    Chapter 265 Tree reconstruction from partial orders
  39. Altmetric Badge
    Chapter 266 Improved parallel depth-first search in undirected planar graphs
  40. Altmetric Badge
    Chapter 267 On approximating the longest path in a graph
  41. Altmetric Badge
    Chapter 268 Designing multi-commodity flow trees
  42. Altmetric Badge
    Chapter 269 A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs
  43. Altmetric Badge
    Chapter 270 On fat partitioning, fat covering and the union size of polygons
  44. Altmetric Badge
    Chapter 271 A time-randomness tradeoff for selection in parallel
  45. Altmetric Badge
    Chapter 272 Detecting race conditions in parallel programs that use one semaphore
  46. Altmetric Badge
    Chapter 273 An algorithm for finding predecessors in integer sets
  47. Altmetric Badge
    Chapter 274 The exhaustion of shared memory: Stochastic results
  48. Altmetric Badge
    Chapter 275 Minimum weight euclidean matching and weighted relative neighborhood graphs
  49. Altmetric Badge
    Chapter 276 Efficient approximate shortest-path queries among isothetic rectangular obstacles
  50. Altmetric Badge
    Chapter 277 Counting and reporting red/blue segment intersections
  51. Altmetric Badge
    Chapter 278 Repetitive hidden-surface-removal for polyhedral scenes
  52. Altmetric Badge
    Chapter 279 On reconfigurability of VLSI linear arrays
  53. Altmetric Badge
    Chapter 280 Reconstructing strings from substrings (Extended abstract)
  54. Altmetric Badge
    Chapter 281 Combinatorial complexity of signed discs
  55. Altmetric Badge
    Chapter 282 Fast algorithms for one-dimensionsal compaction with jog insertion
  56. Altmetric Badge
    Chapter 283 An optimal algorithm for roundness determination on convex polygons
  57. Altmetric Badge
    Chapter 284 Practical algorithms on partial k -trees with an application to domination-like problems
  58. Altmetric Badge
    Chapter 285 Greedy algorithms for the on-line steiner tree and generalized steiner problems
Attention for Chapter 252: Algorithms for polytope covering and approximation
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
17 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
Algorithms for polytope covering and approximation
Chapter number 252
Book title
Algorithms and Data Structures
Published by
Springer Berlin Heidelberg, August 1993
DOI 10.1007/3-540-57155-8_252
Book ISBNs
978-3-54-057155-1, 978-3-54-047918-5
Authors

Kenneth L. Clarkson

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
United States 1 6%
Unknown 16 94%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 4 24%
Student > Bachelor 3 18%
Researcher 3 18%
Student > Doctoral Student 2 12%
Student > Master 1 6%
Other 3 18%
Unknown 1 6%
Readers by discipline Count As %
Computer Science 9 53%
Mathematics 2 12%
Agricultural and Biological Sciences 1 6%
Business, Management and Accounting 1 6%
Physics and Astronomy 1 6%
Other 1 6%
Unknown 2 12%