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: Efficient Approximation and Online Algorithms
    sub title: Recent Progress on Classical Combinatorial Optimization Problems and New Applications
  name:
    name part: Bampis, Evripidis.
    role:
      role term: editor.
  name:
    name part: Jansen, Klaus.
    role:
      role term: editor.
  name:
    name part: Kenyon, Claire.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2006
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: VII, 349 p. online resource.
  table of contents: Contributed Talks -- On Approximation Algorithms for Data Mining Applications -- A Survey of Approximation Results for Local Search Algorithms -- Approximation Algorithms for Path Coloring in Trees -- Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow -- Independence and Coloring Problems on Intersection Graphs of Disks -- Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications -- A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines -- Approximating a Class of Classification Problems -- List Scheduling in Order of ?-Points on a Single Machine -- Approximation Algorithms for the k-Median Problem -- The Lovász-Local-Lemma and Scheduling.
  note: edited by Evripidis Bampis, Klaus Jansen, Claire Kenyon.
  subject:
    topic: Computer science
  subject:
    topic: Computer communication systems
  subject:
    topic: Algorithms
  subject:
    topic: Numerical analysis
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Computer graphics
  subject:
    topic: Computer Science
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Discrete Mathematics in Computer Science
  subject:
    topic: Numeric Computing
  subject:
    topic: Computer Communication Networks
  subject:
    topic: Computer Graphics
  subject:
    topic: Algorithms
  classification: QA76.9.A43
  classification: 005.1
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 3484
  identifier: 9783540322139
  identifier: http://dx.doi.org/10.1007/11671541
  record info:
    record creation date: 100714
    record change date: 20151204173118.0
    record identifier: 978-3-540-32213-9