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 Algorithms for Combinatorial Optimization
    sub title: International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings
  name:
    name part: Jansen, Klaus.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: Rolim, Jose.
    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: 1998
    edition: 1st ed. 1998.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: IX, 207 p. online resource.
  abstract: This book constitutes the refereed proceedings of the International Workshop on Approximation Algorithms for Combinatorical Optimization, APPROX'98, held in conjunction with ICALP'98 in Aalborg, Denmark, in July 1998. The volume presents 14 revised full papers together with three invited papers selected from 37 submissions. The papers address the design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and various applications.
  table of contents: Approximations of independent sets in graphs -- Using linear programming in the design and analysis of approximation algorithms: Two illustrative problems -- The Steiner tree problem and its generalizations -- Approximation schemes for covering and scheduling in related machines -- One for the price of two: A unified approach for approximating covering problems -- Approximation of geometric dispersion problems -- Approximating k-outconnected subgraph problems -- Lower bounds for on-line scheduling with precedence constraints on identical machines -- Instant recognition of half integrality and 2-approximations -- The t-vertex cover problem: Extending the half integrality framework with budget constraints -- A new fully polynomial approximation scheme for the knapsack problem -- On the hardness of approximating spanners -- Approximating circular arc colouring and bandwidth allocation in all-optical ring networks -- Approximating maximum independent set in k-clique-free graphs -- Approximating an interval scheduling problem -- Finding dense subgraphs with semidefinite programming -- Best possible approximation algorithm for MAX SAT with cardinality constraint.
  note: edited by Klaus Jansen, Jose Rolim.
  subject:
    topic: Computers
  subject:
    topic: Algorithms
  subject:
    topic: Computer science-Mathematics
  subject:
    topic: Calculus of variations
  subject:
    topic: Computer graphics
  subject:
    topic: Theory of Computation
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Discrete Mathematics in Computer Science
  subject:
    topic: Calculus of Variations and Optimal Control; Optimization
  subject:
    topic: Computer Graphics
  classification: QA75.5-76.95
  classification: QA76.63
  classification: 004.0151
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 1444
  identifier: 9783540690672
  identifier: https://doi.org/10.1007/BFb0053958
  record info:
    record creation date: 121227
    record change date: 20191026132723.0
    record identifier: 978-3-540-69067-2