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 2007
    sub title: 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007. Proceedings
  name:
    name part: Arge, Lars.
    role:
      role term: editor.
  name:
    name part: Hoffmann, Michael.
    role:
      role term: editor.
  name:
    name part: Welzl, Emo.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2007
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XV, 772 p. online resource.
  table of contents: Invited Lectures -- Nash Equilibria: Where We Stand -- Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation -- Arrangements in Geometry: Recent Advances and Challenges -- Contributed Papers: Design and Analysis Track -- Nash Equilibria in Voronoi Games on Graphs -- Evolutionary Equilibrium in Bayesian Routing Games: Specialization and Niche Formation -- Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks -- Finding Frequent Elements in Non-bursty Streams -- Tradeoffs and Average-Case Equilibria in Selfish Routing -- On the Variance of Subset Sum Estimation -- On Minimum Power Connectivity Problems -- On the Cost of Interchange Rearrangement in Strings -- Finding Mobile Data: Efficiency vs. Location Inaccuracy -- A Faster Query Algorithm for the Text Fingerprinting Problem -- Polynomial Time Algorithms for Minimum Energy Scheduling -- k-Mismatch with Don’t Cares -- Finding Branch-Decompositions and Rank-Decompositions -- Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover -- Linear-Time Ranking of Permutations -- Radix Sorting with No Extra Space -- Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation -- Order Statistics in the Farey Sequences in Sublinear Time -- New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks -- Dial a Ride from k-Forest -- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue -- Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication -- Optimal Algorithms for k-Search with Application in Option Pricing -- Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra -- Stackelberg Strategies for Atomic Congestion Games -- Good Quality Virtual Realization of Unit Ball Graphs -- Algorithms for Playing Games with Limited Randomness -- Approximation of Partial Capacitated Vertex Cover -- Optimal Resilient Dynamic Dictionarie…
  note: edited by Lars Arge, Michael Hoffmann, Emo Welzl.
  subject:
    topic: Computer science
  subject:
    topic: Computer communication systems
  subject:
    topic: Software engineering
  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: Software Engineering/Programming and Operating Systems
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Numeric Computing
  subject:
    topic: Discrete Mathematics in Computer Science
  subject:
    topic: Data Structures
  subject:
    topic: Computer Communication Networks
  classification: QA76.758
  classification: 005.1
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 4698
  identifier: 9783540755203
  identifier: http://dx.doi.org/10.1007/978-3-540-75520-3
  record info:
    record creation date: 100301
    record change date: 20151204191609.0
    record identifier: 978-3-540-75520-3