Coverart for item
The Resource Approximation and online algorithms : 7th international workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 : revised papers, Evripidis Bampis, Klaus Jansen (eds.)

Approximation and online algorithms : 7th international workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 : revised papers, Evripidis Bampis, Klaus Jansen (eds.)

Label
Approximation and online algorithms : 7th international workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 : revised papers
Title
Approximation and online algorithms
Title remainder
7th international workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 : revised papers
Statement of responsibility
Evripidis Bampis, Klaus Jansen (eds.)
Title variation
WAOA 2009
Creator
Contributor
Subject
Genre
Language
eng
Summary
Annotation
Member of
Is part of
Cataloging source
GW5XE
Dewey number
005.1
Illustrations
illustrations
Index
index present
LC call number
QA76.9.A43
LC item number
W42 2009
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2009
http://bibfra.me/vocab/lite/meetingName
WAOA 2009
Nature of contents
  • dictionaries
  • bibliography
NLM call number
QA 76.9.A43
http://library.link/vocab/relatedWorkOrContributorName
  • Bampis, Evripidis
  • Jansen, Klaus
Series statement
  • Lecture notes in computer science,
  • LNCS sublibrary. SL 1, Theoretical computer science and general issues
Series volume
5893
http://library.link/vocab/subjectName
  • Online algorithms
  • Mathematical optimization
  • Algorithms
  • Computing Methodologies
  • Algorithmes en ligne
  • Optimisation mathématique
  • Informatique
  • Mathematical optimization
  • Online algorithms
Summary expansion
This book constitutes the thoroughly refereed post workshop proceedings of the 7th International Workshop on Approximation and Online Algorithms, WAOA 2009, held in Copenhagen, Denmark, in September 2009 as part of the ALGO 2009 conference event. The 22 revised full papers presented were carefully reviewed and selected from 62 submissions. The workshop covered areas such as algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized complexity, randomization techniques, real-world applications, andscheduling problems
Label
Approximation and online algorithms : 7th international workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 : revised papers, Evripidis Bampis, Klaus Jansen (eds.)
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
On the competitiveness of the online asymmetric and Euclidean Steiner tree problems / Spyros Angelopoulos -- Extension of the Nemhauser and Trotter Theorem to generalized vertex cover with applications / Reuven Bar-Yehuda, Danny Hermelin, and Dror Rawitz -- Price fluctuations : to buy or to rent / Marcin Bienkowski -- Approximation algorithms for multiple strip packing / Marin Bougeret, Pierre Francois Dutot, Klaus Jansen, Christina Otte, and Denis Trystram -- Approximating frequent items in asynchronous data stream over a sliding window / Ho-Leung Chan, Tak-Wah Lam, Lap-Kei Lee, and Hing-Fung Ting -- Longest wait first for broadcast scheduling (extended abastract) / Chandra Chekuri, Sungjin Im, and Benjamin Moseley -- The routing open shop problem : new approximation algorithms / Ilya Chernykh, Nikita Dryuck, Alexander Kononov, and Sergey Sevastyanov -- On the price of stability for undirected network design / George Christodoulou, Christine Chung, Katrina Ligett, Evangelia Pyrga, and Rob van Stee -- Finding dense subgraphs in G(n, 1/2) / Atish Das Sarma, Amit Deshpande, and Ravi Kannan -- Parameterized analysis of paging and list update algorithms / Reza Dorrigiv, Martin R. Ehmsen, and Alejandro López-Ortiz -- Online scheduling of bounded length jobs to maximize throughput / Christoph Dürr, Łukasz Jeż, and Kim Thang Nguyen -- On the additive constant of the k-server work function algorithm / Yuval Emek, Pierre Fraigniaud, Amos Korman, and Adi Rosén -- A (4+e)-approximation for the minimum-weight dominating set problem in unit disk graphs / Thomas Erlebach and Matús̆ Mihalák -- Guard games on graphs : keep the intruder out! / Fedor V. Fomin, Petr A. Golovach, and Daniel Lokshtanov -- Between a rock and a hard place : the two-to-one assignment problem / Dries Goossens, Sergey Polyakovskiy, Frits C.R. Spieksma, and Gerhard J. Woeginger -- Scheduling and packing malleable tasks with precedence constraints of bounded width / Elisabeth Günther, Felix G. König, and Nicole Megow -- Online minimization knapsack problem / Xin Han and Kazuhisa Makino -- Optimization problems in multiple subtree graphs / Danny Hermelin and Dror Rawitz -- Multi-criteria TSP : min and max combined / Bodo Manthey -- Packet routing : complexity and algorithms / Britta Peis, Martin Skutella, and Andreas Wiese -- Minimal cost reconfiguration of data placement in storage area network / Hadas Shachnai, Gal Tamir, and Tami Tamir -- Competitive multi-dimensional dynamic bin packing via L-shape bin packing / Prudence W.H. Wong and Fencol C.C. Yung
Control code
663093912
Dimensions
unknown
Extent
1 online resource (x, 254 pages)
Form of item
online
Isbn
9783642124501
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-642-12450-1
Other physical details
illustrations
Specific material designation
remote
System control number
(OCoLC)663093912
Label
Approximation and online algorithms : 7th international workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 : revised papers, Evripidis Bampis, Klaus Jansen (eds.)
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
On the competitiveness of the online asymmetric and Euclidean Steiner tree problems / Spyros Angelopoulos -- Extension of the Nemhauser and Trotter Theorem to generalized vertex cover with applications / Reuven Bar-Yehuda, Danny Hermelin, and Dror Rawitz -- Price fluctuations : to buy or to rent / Marcin Bienkowski -- Approximation algorithms for multiple strip packing / Marin Bougeret, Pierre Francois Dutot, Klaus Jansen, Christina Otte, and Denis Trystram -- Approximating frequent items in asynchronous data stream over a sliding window / Ho-Leung Chan, Tak-Wah Lam, Lap-Kei Lee, and Hing-Fung Ting -- Longest wait first for broadcast scheduling (extended abastract) / Chandra Chekuri, Sungjin Im, and Benjamin Moseley -- The routing open shop problem : new approximation algorithms / Ilya Chernykh, Nikita Dryuck, Alexander Kononov, and Sergey Sevastyanov -- On the price of stability for undirected network design / George Christodoulou, Christine Chung, Katrina Ligett, Evangelia Pyrga, and Rob van Stee -- Finding dense subgraphs in G(n, 1/2) / Atish Das Sarma, Amit Deshpande, and Ravi Kannan -- Parameterized analysis of paging and list update algorithms / Reza Dorrigiv, Martin R. Ehmsen, and Alejandro López-Ortiz -- Online scheduling of bounded length jobs to maximize throughput / Christoph Dürr, Łukasz Jeż, and Kim Thang Nguyen -- On the additive constant of the k-server work function algorithm / Yuval Emek, Pierre Fraigniaud, Amos Korman, and Adi Rosén -- A (4+e)-approximation for the minimum-weight dominating set problem in unit disk graphs / Thomas Erlebach and Matús̆ Mihalák -- Guard games on graphs : keep the intruder out! / Fedor V. Fomin, Petr A. Golovach, and Daniel Lokshtanov -- Between a rock and a hard place : the two-to-one assignment problem / Dries Goossens, Sergey Polyakovskiy, Frits C.R. Spieksma, and Gerhard J. Woeginger -- Scheduling and packing malleable tasks with precedence constraints of bounded width / Elisabeth Günther, Felix G. König, and Nicole Megow -- Online minimization knapsack problem / Xin Han and Kazuhisa Makino -- Optimization problems in multiple subtree graphs / Danny Hermelin and Dror Rawitz -- Multi-criteria TSP : min and max combined / Bodo Manthey -- Packet routing : complexity and algorithms / Britta Peis, Martin Skutella, and Andreas Wiese -- Minimal cost reconfiguration of data placement in storage area network / Hadas Shachnai, Gal Tamir, and Tami Tamir -- Competitive multi-dimensional dynamic bin packing via L-shape bin packing / Prudence W.H. Wong and Fencol C.C. Yung
Control code
663093912
Dimensions
unknown
Extent
1 online resource (x, 254 pages)
Form of item
online
Isbn
9783642124501
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-642-12450-1
Other physical details
illustrations
Specific material designation
remote
System control number
(OCoLC)663093912

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125
Processing Feedback ...