Approximation and online algorithms : 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015, revised selected papers / edited by Laura Sanità, Martin Skutella.

By: (13th : WAOA (Workshop) (13th : 2015 : Patrai, Greece)
Contributor(s): Sanità, Laura [editor.] | Skutella, Martin (Mathematician) [editor.]
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 9499.; LNCS sublibrary: Publisher: Cham : Springer, 2015Copyright date: ©2015Description: 1 online resource (x, 209 pages) : color illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783319286846; 3319286846Other title: WAOA 2015Subject(s): Online algorithms -- Congresses | Approximation algorithms -- Congresses | Computers -- Data Processing | Computers -- Data Modeling & Design | Computers -- Programming -- Algorithms | Computers -- Machine Theory | Discrete mathematics | Algorithms & data structures | Numerical analysis | User interface design & usability | Mathematical theory of computation | Approximation algorithms | Online algorithmsGenre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Approximation and online algorithms.DDC 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 -- Mechanism design -- Natural algorithms -- Network design -- Packing and covering.-Paradigms for the design and analysis of approximation and online algorithms.-Parameterized complexity. Scheduling problems.-Real-world applications.
Summary: This book constitutes the thoroughly refereed post-workshop proceedings of the 13th International Workshop on Approximation and Online Algorithms, WAOA 2015, held in Patras, Greece, in September 2015 as part of ALGO 2015. The 17 revised full papers presented were carefully reviewed and selected from 40 submissions. Topics of interest for WAOA 2015 were: algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, graph algorithms, inapproximability, mechanism design, natural algorithms, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, scheduling problems, and real-world applications.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes bibliographical references and author index.

Online resource; title from PDF title page (SpringerLink, viewed January 21, 2016).

Algorithmic game theory -- Algorithmic trading -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Graph algorithms -- Inapproximability -- Mechanism design -- Natural algorithms -- Network design -- Packing and covering.-Paradigms for the design and analysis of approximation and online algorithms.-Parameterized complexity. Scheduling problems.-Real-world applications.

This book constitutes the thoroughly refereed post-workshop proceedings of the 13th International Workshop on Approximation and Online Algorithms, WAOA 2015, held in Patras, Greece, in September 2015 as part of ALGO 2015. The 17 revised full papers presented were carefully reviewed and selected from 40 submissions. Topics of interest for WAOA 2015 were: algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, graph algorithms, inapproximability, mechanism design, natural algorithms, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, scheduling problems, and real-world applications.

English.

There are no comments for this item.

to post a comment.

Powered by Koha