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: Approximation and Online Algorithms
    sub title: 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers
  name:
    name part: Sanità, Laura.
    role:
      role term: editor.
  name:
    name part: Skutella, Martin.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2015
    edition: 1st ed. 2015.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: X, 209 p. 24 illus. in color. online resource.
  abstract: This book constitutes the thoroughly refereed post-workshop proceedings of the 13th International Workshop on Approximation and Online Algorithms, WAOA 2015, held in Patras, Greece, in September 2015 as part of ALGO 2015. The 17 revised full papers presented were carefully reviewed and selected from 40 submissions. Topics of interest for WAOA 2015 were: algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, graph algorithms, inapproximability, mechanism design, natural algorithms, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, scheduling problems,and real-world applications.
  table of contents: Algorithmic game theory -- Algorithmic trading -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Graph algorithms -- Inapproximability -- Mechanism design -- Natural algorithms -- Network design -- Packing and covering.-Paradigms for the design and analysis of approximation and online algorithms.-Parameterized complexity. Scheduling problems. -Real-world applications.
  note: edited by Laura Sanità, Martin Skutella.
  subject:
    topic: Computer science
  subject:
    topic: Data structures (Computer science)
  subject:
    topic: Computers
  subject:
    topic: Algorithms
  subject:
    topic: Numerical analysis
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Computer Science
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Discrete Mathematics in Computer Science
  subject:
    topic: Data Structures
  subject:
    topic: Algorithms
  subject:
    topic: Computation by Abstract Devices
  subject:
    topic: Numeric Computing
  classification: QA76.9.A43
  classification: 005.1
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 9499
  identifier: 9783319286846
  identifier: http://dx.doi.org/10.1007/978-3-319-28684-6
  record info:
    record creation date: 160112
    record change date: 20160113142920.0
    record identifier: 978-3-319-28684-6