rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Algorithms - ESA 2008
    sub title: 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings
  name:
    name part: Halperin, Dan.
    role:
      role term: editor.
  name:
    name part: Mehlhorn, Kurt.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2008
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XVII, 844 p. online resource.
  abstract: This book constitutes the refereed proceedings of the 16th Annual European Symposium on Algorithms, ESA 2008, held in Karlsruhe, Germany, in September 2008 in the context of the combined conference ALGO 2008. The 67 revised full papers presented together with 2 invited lectures were carefully reviewed and selected: 51 papers out of 147 submissions for the design and analysis track and 16 out of 53 submissions in the engineering and applications track. The papers address all current subjects in algorithmics reaching from design and analysis issues of algorithms over to real-world applications and engineering of algorithms in various fields. Special focus is given to mathematical programming and operations research, including combinatorial optimization, integer programming, polyhedral combinatorics and network optimization.
  table of contents: Invited Lectures -- Flexible Path Planning Using Corridor Maps -- A Bridging Model for Multi-core Computing -- Contributed Papers -- Robust Kinetic Convex Hulls in 3D -- On Dominance Reporting in 3D -- Stabbing Convex Polygons with a Segment or a Polygon -- An Efficient Algorithm for 2D Euclidean 2-Center with Outliers -- A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry -- Cache-Oblivious Red-Blue Line Segment Intersection -- The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains -- Space-Time Tradeoffs for Proximity Searching in Doubling Spaces -- A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem -- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs -- Straight Skeletons of Three-Dimensional Polyhedra -- Randomized Competitive Analysis for Two-Server Problems -- Decompositions and Boundary Coverings of Non-convex Fat Polyhedra -- Approximating Multi-criteria Max-TSP -- An Integer Programming Algorithm for Routing Optimization in IP Networks -- A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling -- Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree -- Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors -- A Practical Quicksort Algorithm for Graphics Processors -- Bloomier Filters: A Second Look -- Coupled Path Planning, Region Optimization, and Applications in Intensity-Modulated Radiation Therapy -- A New Approach to Exact Crossing Minimization -- A Characterization of 2-Player Mechanisms for Scheduling -- A Local-Search 2-Approximation for 2-Correlation-Clustering -- The Alcuin Number of a Graph -- Time-Dependent SHARC-Routing -- Detecting Regular Visit Patterns -- Improved Approximation Algorithms for Relay Placement -- Selfish Bin Packing -- Improved Randomized Results for That Interval Selection Problem -- Succinct Representations of Arbitrary Graphs -- Edge Coloring and Decompositi…
  note: edited by Dan Halperin, Kurt Mehlhorn.
  subject:
    topic: Computer science
  subject:
    topic: Computer communication systems
  subject:
    topic: Computer programming
  subject:
    topic: Computers
  subject:
    topic: Algorithms
  subject:
    topic: Numerical analysis
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Computer Science
  subject:
    topic: Programming Techniques
  subject:
    topic: Computer Communication Networks
  subject:
    topic: Theory of Computation
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Numeric Computing
  subject:
    topic: Discrete Mathematics in Computer Science
  classification: QA76.6-76.66
  classification: 005.11
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 5193
  identifier: 9783540877448
  identifier: http://dx.doi.org/10.1007/978-3-540-87744-8
  record info:
    record creation date: 100301
    record change date: 20151204142027.0
    record identifier: 978-3-540-87744-8