1 option
Approximation and Online Algorithms : 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers / edited by Laura Sanità, Martin Skutella.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 9499.
- Theoretical Computer Science and General Issues ; 9499
- Language:
- English
- Subjects (All):
- Algorithms.
- Computer science--Mathematics.
- Computer science.
- Data structures (Computer science).
- Computers.
- Numerical analysis.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Data Structures.
- Computation by Abstract Devices.
- Numeric Computing.
- Local Subjects:
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Data Structures.
- Algorithms.
- Computation by Abstract Devices.
- Numeric Computing.
- Physical Description:
- 1 online resource (X, 209 pages) : 24 illustrations in color.
- Edition:
- First edition 2015.
- Contained In:
- Springer eBooks
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2015.
- System Details:
- text file PDF
- 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.
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-28684-6
- 9783319286846
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.