Amazon cover image
Image from Amazon.com

Approximation and online algorithms : 11th International Workshop, WAOA 2013, Sophia Antipolis, France, September 5-6, 2013, Revised selected papers / Christos Kaklamanis, Kirk Pruhs (eds.).

By: (11th : WAOA (Workshop) (11th : 2013 : Sophia Antipolis, France)Contributor(s): Kaklamanis, Christos [editor.] | Pruhs, Kirk [editor.]Material type: TextTextSeries: Serienbezeichnung | Lecture notes in computer science ; 8447. | LNCS sublibrary. SL 1, Theoretical computer science and general issues.Publisher: Cham : Springer, 2014Description: 1 online resource (x, 169 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783319080017; 3319080016; 3319080008; 9783319080000Other title: WAOA 2013Subject(s): Online algorithms -- Congresses | Approximation algorithms -- Congresses | Approximation algorithms | Online algorithms | computerwetenschappen | computer sciences | numerieke methoden | numerical methods | computertechnieken | computer techniques | wiskunde | mathematics | algoritmen | algorithms | computeranalyse | computer analysis | Information and Communication Technology (General) | Informatie- en communicatietechnologie (algemeen)Genre/Form: Electronic books. | Electronic books. | Ebook. | Conference papers and proceedings. Additional physical formats: Printed edition:: No titleDDC 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.
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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes author index.

Online resource; title from PDF title page (SpringerLink, viewed June 23, 2014).

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.

Powered by Koha