↓ Skip to main content
What is this page? Embed badge

Algorithms - ESA 2008

Overview of attention for book
Cover of 'Algorithms - ESA 2008'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Flexible Path Planning Using Corridor Maps
  3. Altmetric Badge
    Chapter 2 A Bridging Model for Multi-core Computing
  4. Altmetric Badge
    Chapter 3 Robust Kinetic Convex Hulls in 3D
  5. Altmetric Badge
    Chapter 4 On Dominance Reporting in 3D
  6. Altmetric Badge
    Chapter 5 Stabbing Convex Polygons with a Segment or a Polygon
  7. Altmetric Badge
    Chapter 6 An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
  8. Altmetric Badge
    Chapter 7 A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
  9. Altmetric Badge
    Chapter 8 Cache-Oblivious Red-Blue Line Segment Intersection
  10. Altmetric Badge
    Chapter 9 The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains
  11. Altmetric Badge
    Chapter 10 Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
  12. Altmetric Badge
    Chapter 11 A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem
  13. Altmetric Badge
    Chapter 12 Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
  14. Altmetric Badge
    Chapter 13 Straight Skeletons of Three-Dimensional Polyhedra
  15. Altmetric Badge
    Chapter 14 Randomized Competitive Analysis for Two-Server Problems
  16. Altmetric Badge
    Chapter 15 Decompositions and Boundary Coverings of Non-convex Fat Polyhedra
  17. Altmetric Badge
    Chapter 16 Approximating Multi-criteria Max-TSP
  18. Altmetric Badge
    Chapter 17 An Integer Programming Algorithm for Routing Optimization in IP Networks
  19. Altmetric Badge
    Chapter 18 A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
  20. Altmetric Badge
    Chapter 19 Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree
  21. Altmetric Badge
    Chapter 20 Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors
  22. Altmetric Badge
    Chapter 21 A Practical Quicksort Algorithm for Graphics Processors
  23. Altmetric Badge
    Chapter 22 Bloomier Filters: A Second Look
  24. Altmetric Badge
    Chapter 23 Coupled Path Planning, Region Optimization, and Applications in Intensity-Modulated Radiation Therapy
  25. Altmetric Badge
    Chapter 24 A New Approach to Exact Crossing Minimization
  26. Altmetric Badge
    Chapter 25 Algorithms - ESA 2008
  27. Altmetric Badge
    Chapter 26 A Local-Search 2-Approximation for 2-Correlation-Clustering
  28. Altmetric Badge
    Chapter 27 The Alcuin Number of a Graph
  29. Altmetric Badge
    Chapter 28 Time-Dependent SHARC-Routing
  30. Altmetric Badge
    Chapter 29 Detecting Regular Visit Patterns
  31. Altmetric Badge
    Chapter 30 Improved Approximation Algorithms for Relay Placement
  32. Altmetric Badge
    Chapter 31 Selfish Bin Packing
  33. Altmetric Badge
    Chapter 32 Improved Randomized Results for That Interval Selection Problem
  34. Altmetric Badge
    Chapter 33 Succinct Representations of Arbitrary Graphs
  35. Altmetric Badge
    Chapter 34 Edge Coloring and Decompositions of Weighted Graphs
  36. Altmetric Badge
    Chapter 35 The Complexity of Sorting with Networks of Stacks and Queues
  37. Altmetric Badge
    Chapter 36 Faster Steiner Tree Computation in Polynomial-Space
  38. Altmetric Badge
    Chapter 37 Fitting a Step Function to a Point Set
  39. Altmetric Badge
    Chapter 38 Faster Swap Edge Computation in Minimum Diameter Spanning Trees
  40. Altmetric Badge
    Chapter 39 The Partial Augment–Relabel Algorithm for the Maximum Flow Problem
  41. Altmetric Badge
    Chapter 40 An Optimal Dynamic Spanner for Doubling Metric Spaces
  42. Altmetric Badge
    Chapter 41 RFQ: Redemptive Fair Queuing
  43. Altmetric Badge
    Chapter 42 Range Medians
  44. Altmetric Badge
    Chapter 43 Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves
  45. Altmetric Badge
    Chapter 44 Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison
  46. Altmetric Badge
    Chapter 45 On the Complexity of Optimal Hotlink Assignment
  47. Altmetric Badge
    Chapter 46 Oblivious Randomized Direct Search for Real-Parameter Optimization
  48. Altmetric Badge
    Chapter 47 Path Minima in Incremental Unrooted Trees
  49. Altmetric Badge
    Chapter 48 Improved Competitive Performance Bounds for CIOQ Switches
  50. Altmetric Badge
    Chapter 49 Two-Stage Robust Network Design with Exponential Scenarios
  51. Altmetric Badge
    Chapter 50 An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
  52. Altmetric Badge
    Chapter 51 More Robust Hashing: Cuckoo Hashing with a Stash
  53. Altmetric Badge
    Chapter 52 Better and Simpler Approximation Algorithms for the Stable Marriage Problem
  54. Altmetric Badge
    Chapter 53 Edit Distances and Factorisations of Even Permutations
  55. Altmetric Badge
    Chapter 54 Algorithms - ESA 2008
  56. Altmetric Badge
    Chapter 55 Facility Location in Dynamic Geometric Data Streams
  57. Altmetric Badge
    Chapter 56 The Effects of Local Randomness in the Adversarial Queueing Model
  58. Altmetric Badge
    Chapter 57 Parallel Imaging Problem
  59. Altmetric Badge
    Chapter 58 An Online Algorithm for Finding the Longest Previous Factors
  60. Altmetric Badge
    Chapter 59 Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions
  61. Altmetric Badge
    Chapter 60 Improved BDD Algorithms for the Simulation of Quantum Circuits
  62. Altmetric Badge
    Chapter 61 Mobile Route Planning
  63. Altmetric Badge
    Chapter 62 How Reliable Are Practical Point-in-Polygon Strategies?
  64. Altmetric Badge
    Chapter 63 Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach
  65. Altmetric Badge
    Chapter 64 Approximability of Average Completion Time Scheduling on Unrelated Machines
  66. Altmetric Badge
    Chapter 65 Relative Convex Hulls in Semi-dynamic Subdivisions
  67. Altmetric Badge
    Chapter 66 An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms
  68. Altmetric Badge
    Chapter 67 On the Size of the 3D Visibility Skeleton: Experimental Results
  69. Altmetric Badge
    Chapter 68 An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
  70. Altmetric Badge
    Chapter 69 Deterministic Sampling Algorithms for Network Design
Attention for Chapter 47: Path Minima in Incremental Unrooted Trees
Altmetric Badge

Mentioned by

twitter
1 X user

Citations

dimensions_citation
5 Dimensions

Readers on

mendeley
2 Mendeley
Summary X Dimensions citations
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
Path Minima in Incremental Unrooted Trees
Chapter number 47
Book title
Algorithms - ESA 2008
Published by
Springer, Berlin, Heidelberg, September 2008
DOI 10.1007/978-3-540-87744-8_47
Book ISBNs
978-3-54-087743-1, 978-3-54-087744-8
Authors

Haim Kaplan, Nira Shafrir, Kaplan, Haim, Shafrir, Nira

View on publisher site
X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
 Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
United States 1 50%
Unknown 1 50%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 50%
Researcher 1 50%
Readers by discipline Count As %
Computer Science 2 100%

This page is provided by Altmetric.