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: First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003. Revised Papers
  name:
    name part: Solis-Oba, Roberto.
    role:
      role term: editor.
  name:
    name part: Jansen, Klaus.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2004
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: VIII, 268 p. online resource.
  abstract: The Workshop on Approximation and Online Algorithms (WAOA 2003) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications ar- ing from a variety of ?elds. The workshop also covered experimental research on approximation and online algorithms. WAOA 2003 took place in Budapest, Hungary, from September 16 to September 18. The workshop was part of the ALGO 2003 event, which also hosted ESA 2003, WABI 2003, and ATMOS 2003. TopicsofinterestforWAOA2003were:competitiveanalysis,inapproximab- ityresults,randomizationtechniques,approximationclasses,scheduling,coloring and partitioning, cuts and connectivity, packing and covering, geometric pr- lems, network design, and applications to game theory and ?nancial problems. In response to our call for papers we received 41 submissions. Each submission was reviewed by at least 3 referees, who judged the papers on originality, quality, and consistency with the topics of the conference. Based on these reviews the program committee selected 19 papers for presentation at the workshop and for publication in this proceedings. This volume contains the 19 selected papers and 5 invited abstracts from an ARACNE minisymposium which took place as part of WAOA.
  table of contents: Contributed Talks -- Online Coloring of Intervals with Bandwidth -- Open Block Scheduling in Optical Communication Networks -- Randomized Priority Algorithms -- Tradeoffs in Worst-Case Equilibria -- Load Balancing of Temporary Tasks in the ? p Norm -- Simple On-Line Algorithms for Call Control in Cellular Networks -- Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees -- A -Approximation Algorithm for Scheduling Identical Malleable Tasks -- Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation -- Scheduling AND/OR-Networks on Identical Parallel Machines -- Combinatorial Interpretations of Dual Fitting and Primal Fitting -- On the Approximability of the Minimum Fundamental Cycle Basis Problem -- The Pledge Algorithm Reconsidered under Errors in Sensors and Motion -- The Online Matching Problem on a Line -- How to Whack Moles -- Online Deadline Scheduling: Team Adversary and Restart -- Minimum Sum Multicoloring on the Edges of Trees -- Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms -- On-Line Extensible Bin Packing with Unequal Bin Sizes -- ARACNE Talks -- Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms -- Power Consumption Problems in Ad-Hoc Wireless Networks -- A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem -- Disk Graphs: A Short Survey -- Combinatorial Techniques for Memory Power State Scheduling in Energy-Constrained Systems.
  note: edited by Roberto Solis-Oba, Klaus Jansen.
  subject:
    topic: Computer science
  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 graphics
  subject:
    topic: Computer Science
  subject:
    topic: Software Engineering/Programming and Operating Systems
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Data Structures
  subject:
    topic: Numeric Computing
  subject:
    topic: Discrete Mathematics in Computer Science
  subject:
    topic: Computer Graphics
  classification: QA76.758
  classification: 005.1
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 2909
  identifier: 9783540245926
  identifier: http://dx.doi.org/10.1007/b95598
  record info:
    record creation date: 121227
    record change date: 20151204162653.0
    record identifier: 978-3-540-24592-6