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 2005
    sub title: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005. Proceedings
  name:
    name part: Brodal, Gerth Stølting.
    role:
      role term: editor.
  name:
    name part: Leonardi, Stefano.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2005
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XVIII, 901 p. online resource.
  table of contents: Designing Reliable Algorithms in Unreliable Memories -- From Balanced Graph Partitioning to Balanced Metric Labeling -- Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism -- Exploring an Unknown Graph Efficiently -- Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio -- Heuristic Improvements for Computing Maximum Multicommodity Flow and Minimum Multicut -- Relax-and-Cut for Capacitated Network Design -- On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,, -- The Complexity of Games on Highly Regular Graphs -- Computing Equilibrium Prices: Does Theory Meet Practice? -- Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions -- An Algorithm for the SAT Problem for Formulae of Linear Length -- Linear-Time Enumeration of Isolated Cliques -- Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs -- Delineating Boundaries for Imprecise Regions -- Exacus: Efficient and Exact Algorithms for Curves and Surfaces -- Min Sum Clustering with Penalties -- Improved Approximation Algorithms for Metric Max TSP -- Unbalanced Graph Cuts -- Low Degree Connectivity in Ad-Hoc Networks -- 5-Regular Graphs are 3-Colorable with Positive Probability -- Optimal Integer Alphabetic Trees in Linear Time -- Predecessor Queries in Constant Time? -- An Algorithm for Node-Capacitated Ring Routing -- On Degree Constrained Shortest Paths -- A New Template for Solving p-Median Problems for Trees in Sub-quadratic Time -- Roll Cutting in the Curtain Industry -- Space Efficient Algorithms for the Burrows-Wheeler Backtransformation -- Cache-Oblivious Comparison-Based Algorithms on Multisets -- Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation -- Allocating Memory in a Lock-Free Manner -- Generating Realistic Terrains with Higher-Order Delaunay Triangulations -- I/O-Efficient Construction of Constrained Delaunay Triangulations …
  note: edited by Gerth Stølting Brodal, Stefano Leonardi.
  subject:
    topic: Computer science
  subject:
    topic: Computer communication systems
  subject:
    topic: Computer programming
  subject:
    topic: Data structures (Computer science)
  subject:
    topic: Algorithms
  subject:
    topic: Numerical analysis
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Computer Science
  subject:
    topic: Programming Techniques
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Computer Communication Networks
  subject:
    topic: Data Structures
  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, 3669
  identifier: 9783540319511
  identifier: http://dx.doi.org/10.1007/11561071
  record info:
    record creation date: 100315
    record change date: 20151204163605.0
    record identifier: 978-3-540-31951-1