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: Algorithm Engineering and Experimentation
    sub title: Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers
  name:
    name part: Buchsbaum, Adam L.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: Snoeyink, Jack.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2001
    edition: 1st ed. 2001.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: VIII, 236 p. online resource.
  table of contents: ALENEX'01 -- Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems -- CNOP - A Package for Constrained Network Optimization -- The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests -- Network Tomography through End-to-End Measurements -- Experimental Results on Statistical Approaches to Page Replacement Policies -- Estimating Resemblance of MIDI Documents -- Experiments on Adaptive Set Intersections for Text Retrieval Systems -- PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets -- Hierarchical Clustering of Trees: Algorithms and Experiments -- Travel Planning with Self-Made Maps -- New Algorithmic Challenges Arising in Measurement-Driven Networking Research -- A Probabilistic Spell for the Curse of Dimensionality -- Experimental Evaluation of the Height of a Random Set of Points in a d-Dimensional Cube -- An Empirical Study of a New Approach to Nearest Neighbor Searching -- Spectral Analysis for Data Mining -- Trade Off Between Compression and Search Times in Compact Suffix Array -- Implementation of a PTAS for Scheduling with Release Dates -- Biased Skip Lists for Highly Skewed Access Patterns.
  note: edited by Adam L. Buchsbaum, Jack Snoeyink.
  subject:
    topic: Computer programming
  subject:
    topic: Database management
  subject:
    topic: Algorithms
  subject:
    topic: Data structures (Computer science)
  subject:
    topic: Computer graphics
  subject:
    topic: Numerical analysis
  subject:
    topic: Programming Techniques
  subject:
    topic: Database Management
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Data Structures
  subject:
    topic: Computer Graphics
  subject:
    topic: Numeric Computing
  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, 2153
  identifier: 9783540448082
  identifier: https://doi.org/10.1007/3-540-44808-X
  record info:
    record creation date: 121227
    record change date: 20191220125850.0
    record identifier: 978-3-540-44808-2