Amazon cover image
Image from Amazon.com

Approximation and online algorithms : 15th International Workshop, WAOA 2017, Vienna, Austria, September 7-8, 2017, revised selected papers / Roberto Solis-Oba, Rudolf Fleischer (Eds.).

By: (15th : WAOA (Workshop) (15th : 2017 : Vienna, Austria)Contributor(s): Solis-Oba, Roberto [editor.] | Fleischer, Rudolf [editor.]Material type: TextTextSeries: Serienbezeichnung | Lecture notes in computer science ; 10787. | LNCS sublibrary. SL 1, Theoretical computer science and general issues.Publisher: Cham, Switzerland : Springer, [2018]Description: 1 online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783319894416; 3319894412Subject(s): Online algorithms -- Congresses | Approximation algorithms -- Congresses | Discrete mathematics | Mathematical theory of computation | Algorithms & data structures | Network hardware | Graphics programming | Computers -- Data Processing | Computers -- Programming -- Algorithms | Computers -- Data Modeling & Design | Computers -- Hardware -- Network Hardware | Computers -- Computer Graphics | Approximation algorithms | Online algorithms | Algorithms | Computer graphics | Computer networks | Computer science | Computer science -- Mathematics | Data structures (Computer science) | Numerical analysisGenre/Form: Conference papers and proceedings. | Electronic books. | Electronic books. Additional physical formats: Printed edition:: No titleDDC classification: 005.1 LOC classification: QA76.9.A43 | W36 2017Online resources: Click here to access online
Contents:
Graph algorithms -- Inapproximability results -- Network design -- Packing and covering -- Paradigms for the design and analysis of approximation and online algorithms -- Parameterized complexity -- Scheduling problems -- Algorithmic game theory -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Mechanism design -- Resource augmentation -- Real-world applications.
Summary: This book constitutes the thoroughly refereed workshop post-proceedings of the 15th International Workshop on Approximation and Online Algorithms, WAOA 2017, held in Vienna, Austria, in September 2017 as part of ALGO 2017. The 23 revised full papers presented in this book were carefully reviewed and selected from 50 submissions. Topics of interest for WAOA 2017 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.
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 index.

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

This book constitutes the thoroughly refereed workshop post-proceedings of the 15th International Workshop on Approximation and Online Algorithms, WAOA 2017, held in Vienna, Austria, in September 2017 as part of ALGO 2017. The 23 revised full papers presented in this book were carefully reviewed and selected from 50 submissions. Topics of interest for WAOA 2017 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.

Online resource; title from digital title page (viewed on July 08, 2019).

Powered by Koha