Coverart for item
The Resource Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised selected papers, Roberto Solis-Oba, Giuseppe Persiano (eds.)

Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised selected papers, Roberto Solis-Oba, Giuseppe Persiano (eds.)

Label
Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised selected papers
Title
Approximation and Online Algorithms
Title remainder
9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised selected papers
Statement of responsibility
Roberto Solis-Oba, Giuseppe Persiano (eds.)
Title variation
WAOA 2011
Creator
Contributor
Subject
Genre
Language
eng
Summary
Annotation This book constitutes the thoroughly refereed post-proceedings of the 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, held in Saarbrücken, Germany, in September 2011. The 21 papers presented were carefully reviewed and selected from 48 submissions. The volume also contains an extended abstract of the invited talk of Prof. Klaus Jansen. The Workshop on Approximation and Online Algorithms focuses on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applicationsin a wide variety of fields. Topics of interest for WAOA 2011 were: 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 and scheduling problems
Member of
Cataloging source
GW5XE
Dewey number
005.1
Index
index present
LC call number
QA76.9.A43
LC item number
W36 2011
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2011
http://bibfra.me/vocab/lite/meetingName
WAOA 2011
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
  • Solis-Oba, Roberto
  • Persiano, Giuseppe
Series statement
  • Lecture notes in computer science,
  • LNCS sublibrary. SL 1, Theoretical computer science and general issues
Series volume
7164
http://library.link/vocab/subjectName
  • Online algorithms
  • Approximation algorithms
  • Informatique
  • Approximation algorithms
  • Online algorithms
Label
Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised selected papers, Roberto Solis-Oba, Giuseppe Persiano (eds.)
Instantiates
Publication
Antecedent source
unknown
Bibliography note
Includes bibliographical references and author 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
  • Single Approximation for Biobjective Max TSP
  • Cristina Bazgan, Laurent Gourvès, Jérôme Monnot and Fanny Pascual
  • Parameterized Approximation Algorithms for Hitting Set
  • Ljiljana Brankovic and Henning Fernau
  • Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs
  • Nadine Schwartges, Joachim Spoerhase and Alexander Wolff
  • Optimization over Integers with Robustness in Cost and Few Constraints
  • Kai-Simon Goetzmann, Sebastian Stiller and Claudio Telha
  • A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption
  • Tomáš Ebenlendr and Jiří Sgall
  • Approximation Algorithms for Scheduling and Packing Problems
  • Scheduling Jobs on Identical and Uniform Processors Revisited
  • Klaus Jansen and Christina Robenek
  • Klaus Jansen
  • Approximating Subset k-Connectivity Problems
  • Zeev Nutov
  • Learning in Stochastic Machine Scheduling
  • Sebastián Marbán, Cyriel Rutten and Tjark Vredeveld
  • An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems
  • Wolfgang Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito and Shoji Kasahara, et al.
  • Faster and Simpler Approximation of Stable Matchings
  • Katarzyna Paluch
  • Simpler 3/4-Approximation Algorithms for MAX SAT
  • Anke van Zuylen
  • On Online Algorithms with Advice for the k-Server Problem
  • Marc P. Renault and Adi Rosén
  • Improved Lower Bound for Online Strip Packing
  • (Extended Abstract)
  • Rolf Harren and Walter Kern
  • Competitive Router Scheduling with Structured Data
  • Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat
  • Yishay Mansour, Boaz Patt-Shamir and Dror Rawitz
  • Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems
  • Cristina Bazgan, Laurent Gourvès and Jérôme Monnot
  • Generalized Maximum Flows over Time
  • Martin Groß and Martin Skutella
  • The Price of Anarchy for Minsum Related Machine Scheduling
  • Ruben Hoeksma and Marc Uetz
  • David B. Shmoys and Gwen Spencer
  • Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models
  • Jianqiao Zhu, Ho-Leung Chan and Tak-Wah Lam
  • A New Perspective on List Update: Probabilistic Locality and Working Set
  • Reza Dorrigiv and Alejandro López-Ortiz
  • OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm
  • Gerth Stølting Brodal, Gabriel Moruz and Andrei Negoescu
Control code
785149429
Dimensions
unknown
Extent
1 online resource (x, 273 pages).
File format
unknown
Form of item
online
Isbn
9783642291159
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-642-29116-6
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)785149429
Label
Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised selected papers, Roberto Solis-Oba, Giuseppe Persiano (eds.)
Publication
Antecedent source
unknown
Bibliography note
Includes bibliographical references and author 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
  • Single Approximation for Biobjective Max TSP
  • Cristina Bazgan, Laurent Gourvès, Jérôme Monnot and Fanny Pascual
  • Parameterized Approximation Algorithms for Hitting Set
  • Ljiljana Brankovic and Henning Fernau
  • Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs
  • Nadine Schwartges, Joachim Spoerhase and Alexander Wolff
  • Optimization over Integers with Robustness in Cost and Few Constraints
  • Kai-Simon Goetzmann, Sebastian Stiller and Claudio Telha
  • A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption
  • Tomáš Ebenlendr and Jiří Sgall
  • Approximation Algorithms for Scheduling and Packing Problems
  • Scheduling Jobs on Identical and Uniform Processors Revisited
  • Klaus Jansen and Christina Robenek
  • Klaus Jansen
  • Approximating Subset k-Connectivity Problems
  • Zeev Nutov
  • Learning in Stochastic Machine Scheduling
  • Sebastián Marbán, Cyriel Rutten and Tjark Vredeveld
  • An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems
  • Wolfgang Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito and Shoji Kasahara, et al.
  • Faster and Simpler Approximation of Stable Matchings
  • Katarzyna Paluch
  • Simpler 3/4-Approximation Algorithms for MAX SAT
  • Anke van Zuylen
  • On Online Algorithms with Advice for the k-Server Problem
  • Marc P. Renault and Adi Rosén
  • Improved Lower Bound for Online Strip Packing
  • (Extended Abstract)
  • Rolf Harren and Walter Kern
  • Competitive Router Scheduling with Structured Data
  • Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat
  • Yishay Mansour, Boaz Patt-Shamir and Dror Rawitz
  • Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems
  • Cristina Bazgan, Laurent Gourvès and Jérôme Monnot
  • Generalized Maximum Flows over Time
  • Martin Groß and Martin Skutella
  • The Price of Anarchy for Minsum Related Machine Scheduling
  • Ruben Hoeksma and Marc Uetz
  • David B. Shmoys and Gwen Spencer
  • Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models
  • Jianqiao Zhu, Ho-Leung Chan and Tak-Wah Lam
  • A New Perspective on List Update: Probabilistic Locality and Working Set
  • Reza Dorrigiv and Alejandro López-Ortiz
  • OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm
  • Gerth Stølting Brodal, Gabriel Moruz and Andrei Negoescu
Control code
785149429
Dimensions
unknown
Extent
1 online resource (x, 273 pages).
File format
unknown
Form of item
online
Isbn
9783642291159
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-642-29116-6
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)785149429

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 ...