Scientific Library of Tomsk State University

   E-catalog        

Image from Google Jackets
Normal view MARC view

Approximation and Online Algorithms electronic resource 11th International Workshop, WAOA 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers / edited by Christos Kaklamanis, Kirk Pruhs.

Contributor(s): Kaklamanis, Christos [editor.] | Pruhs, Kirk [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer SciencePublication details: Cham : Springer International Publishing : Imprint: Springer, 2014Description: X, 169 p. 20 illus. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783319080017Subject(s): Computer Science | Computer software | Electronic data processing | Computational complexity | Algorithms | Computer Science | Algorithm Analysis and Problem Complexity | Discrete Mathematics in Computer Science | Numeric Computing | AlgorithmsDDC classification: 005.1 LOC classification: QA76.9.A43Online resources: Click here to access online
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.
In: Springer eBooksSummary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

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.

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.

There are no comments on this title.

to post a comment.