Editors:
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 5426)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Conference series link(s): WAOA: International Workshop on Approximation and Online Algorithms
Conference proceedings info: WAOA 2008.
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (22 papers)
-
Front Matter
-
WAOA 2008
About this book
Keywords
- Approximation
- Partition
- algorithm analysis
- algorithm design
- algorithmic game theory
- algorithmics
- algorithms
- approximation algorithms
- assignment problem
- combinatorial optimization
- competitive analysis
- complexity
- constrained maximization
- cooperation
- scheduling
- algorithm analysis and problem complexity
- data structures
Editors and Affiliations
-
IBISC, CNRS FRE 3190, Université d’Evry Val d’Essonne, Boulevard François Mitterand,, Evry Cedex, France
Evripidis Bampis
-
Technische Universität Berlin, Fakultät II - Mathematik und Naturwissenschaften, Berlin, Germany
Martin Skutella
Bibliographic Information
Book Title: Approximation and Online Algorithms
Book Subtitle: 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008, Revised Papers
Editors: Evripidis Bampis, Martin Skutella
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-540-93980-1
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2009
Softcover ISBN: 978-3-540-93979-5Published: 02 February 2009
eBook ISBN: 978-3-540-93980-1Published: 13 January 2009
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 293
Topics: Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Numeric Computing, Computer Graphics, Data Structures, Algorithms