| Author |
Kaklamanis, Christos, editor.
|
| Title |
Approximation and Online Algorithms : 11th International Workshop, WAOA 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers / edited by Christos Kaklamanis, Kirk Pruhs. |
| OCLC |
978-3-319-08001-7 |
| ISBN |
9783319080017 |
| ISBN/ISSN |
10.1007/978-3-319-08001-7 doi |
| Publisher |
Cham : Springer International Publishing : Imprint: Springer, 2014. |
| Description |
X, 169 pages 20 illustrations : online resource. |
|
text file PDF rda. |
| LC Subject heading/s |
Computer science.
|
|
Computer software.
|
|
Electronic data processing.
|
|
Computational complexity.
|
|
Algorithms.
|
Other
Subject heading/s |
Computer Science.
|
|
Algorithm Analysis and Problem Complexity.
|
|
Discrete Mathematics in Computer Science.
|
|
Numeric Computing.
|
|
Algorithms.
|
| Contents |
Algorithmic game theory -- Algorithmic trading -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Graph algorithms -- Inapproximability results -- Mechanism design -- Natural algorithms -- Network design -- Packing and covering -- Paradigms for the design and analysis of approximation and online algorithms -- Parameterized complexity -- Real-world applications -- Scheduling problems. |
| Summary |
This book constitutes the thoroughly refereed workshop proceedings of the 11th International Workshop on Approximation and Online Algorithms, WAOA 2013, held in Sophia Antipolis, France, in September 2013 as part of the ALGO 2013 conference event. The 14 revised full papers presented were carefully reviewed and selected from 33 submissions. They focus on the design and analysis of algorithms for online and computationally hard problems, for example in algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, graph algorithms, inapproximability results, mechanism design, natural algorithms, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, real-world applications, scheduling problems. |
| Restrictions |
Unlimited user license access. |
|
