1 option
Approximation and Online Algorithms : 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers / edited by Evripidis Bampis, Ola Svensson.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 8952
- Theoretical Computer Science and General Issues, 2512-2029 ; 8952
- Language:
- English
- Subjects (All):
- Algorithms.
- Computer science-Mathematics.
- Discrete mathematics.
- Numerical analysis.
- Discrete Mathematics in Computer Science.
- Numerical Analysis.
- Local Subjects:
- Algorithms.
- Discrete Mathematics in Computer Science.
- Numerical Analysis.
- Physical Description:
- 1 online resource (X, 273 pages) : 29 illustrations
- Edition:
- 1st ed. 2015.
- Contained In:
- Springer Nature eBook
- 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 12th International Workshop on Approximation and Online Algorithms, WAOA 2014, held in Wrocław, Poland, in September 2014 as part of ALGO 2014. The 22 revised full papers presented were carefully reviewed and selected from 49 submissions. They cover a wide range of topics such as coloring and partitioning, competitive analysis, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, and scheduling problems.
- Contents:
- Improved Approximations for the Max k-Colored Clustering Problem
- A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line
- Better Algorithms for Online Bin Stretching
- Online Colored Bin Packing
- Improved Bound for Online Square-into-Square Packing
- Improved Approximation Algorithm for Fault-Tolerant Facility Placement
- The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem
- Online Multi-Coloring with Advice
- Approximating Steiner Trees and Forests with Minimum Number of Steiner Points
- Energy-Efficient Algorithms for Non-pre-emptive Speed-Scaling
- Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage
- Linear-Time Approximation Algorithms for Unit Disk Graphs
- The Minimum Feasible Tileset Problem
- Online Ad Assignment with an Ad Exchange
- Minimum Linear Arrangement of Series-Parallel Graphs
- Online Dual Edge Coloring of Paths and Trees
- Online Packet Scheduling Under Adversarial Jamming
- Generalized Hypergraph Matching via Iterated Packing and Local Ratio
- Steiner Trees with Bounded RC-Delay
- Multiprocessor Jobs, Pre-emptive Schedules, and One-Competitive Online Algorithms
- Routing Under Uncertainty: The a priori Traveling Repairman Problem
- Primal-Dual Algorithms for Precedence Constrained Covering Problems.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-18263-6
- 9783319182636
- 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.