↓ Skip to main content

Algorithms — ESA 2002 : 10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings

Overview of attention for book
Cover of 'Algorithms — ESA 2002 : 10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Solving Traveling Salesman Problems
  3. Altmetric Badge
    Chapter 2 Computing Shapes from Point Cloud Data
  4. Altmetric Badge
    Chapter 3 Mechanism Design for Fun and Profit
  5. Altmetric Badge
    Chapter 4 On Distance Oracles and Routing in Graphs
  6. Altmetric Badge
    Chapter 5 Kinetic Medians and kd-Trees
  7. Altmetric Badge
    Chapter 6 Range Searching in Categorical Data: Colored Range Searching on Grid
  8. Altmetric Badge
    Chapter 7 Near-Linear Time Approximation Algorithms for Curve Simplification
  9. Altmetric Badge
    Chapter 8 Translating a Planar Object to Maximize Point Containment
  10. Altmetric Badge
    Chapter 9 Approximation Algorithms for k-Line Center
  11. Altmetric Badge
    Chapter 10 New Heuristics and Lower Bounds for the Min-Max k-Chinese Postman Problem
  12. Altmetric Badge
    Chapter 11 SCIL — Symbolic Constraints in Integer Linear Programming
  13. Altmetric Badge
    Chapter 12 Implementing I/O-efficient Data Structures Using TPIE
  14. Altmetric Badge
    Chapter 13 On the k-Splittable Flow Problem
  15. Altmetric Badge
    Chapter 14 Partial Alphabetic Trees
  16. Altmetric Badge
    Chapter 15 Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router
  17. Altmetric Badge
    Chapter 16 Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy
  18. Altmetric Badge
    Chapter 17 Two Simplified Algorithms for Maintaining Order in a List
  19. Altmetric Badge
    Chapter 18 Efficient Tree Layout in a Multilevel Memory Hierarchy
  20. Altmetric Badge
    Chapter 19 A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
  21. Altmetric Badge
    Chapter 20 TSP with Neighborhoods of Varying Size
  22. Altmetric Badge
    Chapter 21 1.375-Approximation Algorithm for Sorting by Reversals
  23. Altmetric Badge
    Chapter 22 Radio Labeling with Pre-assigned Frequencies
  24. Altmetric Badge
    Chapter 23 Branch-and-Bound Algorithms for the Test Cover Problem
  25. Altmetric Badge
    Chapter 24 Constructing Plane Spanners of Bounded Degree and Low Weight
  26. Altmetric Badge
    Chapter 25 Eager st-Ordering
  27. Altmetric Badge
    Chapter 26 Three-Dimensional Layers of Maxima
  28. Altmetric Badge
    Chapter 27 Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy
  29. Altmetric Badge
    Chapter 28 Geometric Algorithms for Density-Based Data Clustering
  30. Altmetric Badge
    Chapter 29 Balanced-Replication Algorithms for Distribution Trees
  31. Altmetric Badge
    Chapter 30 Butterflies and Peer-to-Peer Networks
  32. Altmetric Badge
    Chapter 31 Estimating Rarity and Similarity over Data Stream Windows
  33. Altmetric Badge
    Chapter 32 Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels
  34. Altmetric Badge
    Chapter 33 Frequency Estimation of Internet Packet Streams with Limited Space
  35. Altmetric Badge
    Chapter 34 Algorithms — ESA 2002
  36. Altmetric Badge
    Chapter 35 Optimal Graph Exploration without Good Maps
  37. Altmetric Badge
    Chapter 36 Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee
  38. Altmetric Badge
    Chapter 37 Non-independent Randomized Rounding and an Application to Digital Halftoning
  39. Altmetric Badge
    Chapter 38 Computing Homotopic Shortest Paths Efficiently
  40. Altmetric Badge
    Chapter 39 An Algorithm for Dualization in Products of Lattices and Its Applications
  41. Altmetric Badge
    Chapter 40 Determining Similarity of Conformational Polymorphs
  42. Altmetric Badge
    Chapter 41 Minimizing the Maximum Starting Time On-line
  43. Altmetric Badge
    Chapter 42 Vector Assignment Problems: A General Framework
  44. Altmetric Badge
    Chapter 43 Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice
  45. Altmetric Badge
    Chapter 44 Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique
  46. Altmetric Badge
    Chapter 45 Online Companion Caching
  47. Altmetric Badge
    Chapter 46 Deterministic Communication in Radio Networks with Large Labels
  48. Altmetric Badge
    Chapter 47 A Primal Approach to the Stable Set Problem
  49. Altmetric Badge
    Chapter 48 Wide-Sense Nonblocking WDM Cross-Connects
  50. Altmetric Badge
    Chapter 49 Efficient Implementation of a Minimal Triangulation Algorithm
  51. Altmetric Badge
    Chapter 50 Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme
  52. Altmetric Badge
    Chapter 51 The Probabilistic Analysis of a Greedy Satisfiability Algorithm
  53. Altmetric Badge
    Chapter 52 Dynamic Additively Weighted Voronoi Diagrams in 2D
  54. Altmetric Badge
    Chapter 53 Time-Expanded Graphs for Flow-Dependent Transit Times
  55. Altmetric Badge
    Chapter 54 Partially-Ordered Knapsack and Applications to Scheduling
  56. Altmetric Badge
    Chapter 55 A Software Library for Elliptic Curve Cryptography
  57. Altmetric Badge
    Chapter 56 Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows
  58. Altmetric Badge
    Chapter 57 Randomized Approximation Algorithms for Query Optimization Problems on Two Processors
  59. Altmetric Badge
    Chapter 58 Covering Things with Things
  60. Altmetric Badge
    Chapter 59 On-Line Dial-a-Ride Problems under a Restricted Information Model
  61. Altmetric Badge
    Chapter 60 Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs
  62. Altmetric Badge
    Chapter 61 Engineering a Lightweight Suffix Array Construction Algorithm
  63. Altmetric Badge
    Chapter 62 Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations
  64. Altmetric Badge
    Chapter 63 External-Memory Breadth-First Search with Sublinear I/O
  65. Altmetric Badge
    Chapter 64 Frequency Channel Assignment on Planar Networks
  66. Altmetric Badge
    Chapter 65 Design and Implementation of Efficient Data Types for Static Graphs
  67. Altmetric Badge
    Chapter 66 An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem
  68. Altmetric Badge
    Chapter 67 A Fast, Accurate and Simple Method for Pricing European-Asian and Saving-Asian Options
  69. Altmetric Badge
    Chapter 68 Sorting 13 Elements Requires 34 Comparisons
  70. Altmetric Badge
    Chapter 69 Extending Reduction Techniques for the Steiner Tree Problem
  71. Altmetric Badge
    Chapter 70 A Comparison of Multicast Pull Models
  72. Altmetric Badge
    Chapter 71 Online Scheduling for Sorting Buffers
  73. Altmetric Badge
    Chapter 72 Finding the Sink Takes Some Time
  74. Altmetric Badge
    Chapter 73 Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design
  75. Altmetric Badge
    Chapter 74 Minimizing Makespan and Preemption Costs on a System of Uniform Machines
  76. Altmetric Badge
    Chapter 75 Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts
  77. Altmetric Badge
    Chapter 76 High-Level Filtering for Arrangements of Conic Arcs
  78. Altmetric Badge
    Chapter 77 An Approximation Scheme for Cake Division with a Linear Number of Cuts
  79. Altmetric Badge
    Chapter 78 A Simple Linear Time Algorithm for Finding Even Triangulations of 2-Connected Bipartite Plane Graphs
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 tweeter
wikipedia
1 Wikipedia page

Readers on

mendeley
41 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.
Title
Algorithms — ESA 2002 : 10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings
Published by
Springer Science & Business Media, September 2002
DOI 10.1007/3-540-45749-6
ISBNs
978-3-54-044180-9, 978-3-54-045749-7
Editors

Möhring, Rolf, Raman, Rajeev

Twitter Demographics

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

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 41 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 1 2%
Student > Doctoral Student 1 2%
Unknown 39 95%
Readers by discipline Count As %
Computer Science 1 2%
Engineering 1 2%
Unknown 39 95%