Approximation and online algorithms : 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised selected papers /: 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised selected papers. (2015)
- Record Type:
- Book
- Title:
- Approximation and online algorithms : 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised selected papers /: 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised selected papers. (2015)
- Main Title:
- Approximation and online algorithms : 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised selected papers
- Other Titles:
- WAOA 2014
- Further Information:
- Note: Evripidis Bampis, Ola Svensson (eds.).
- Editors:
- Bampis, Evripidis
Svensson, Ola - Other Names:
- WAOA (Workshop), 12th
- 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.
- Publisher Details:
- Cham : Springer
- Publication Date:
- 2015
- Extent:
- 1 online resource (x, 273 pages), illustrations
- Subjects:
- 005.1
Computer science
Online algorithms -- Congresses
Approximation algorithms -- Congresses
Approximation algorithms
Online algorithms
Engineering & Applied Sciences
Computer Science
Computers -- Data Processing
Computers -- Programming -- Algorithms
Discrete mathematics
Mathematical theory of computation
Numerical analysis
Computer software
Computational complexity
Electronic data processing
Algorithms
Algorithms & data structures
Electronic books
Conference papers and proceedings
Electronic books - Languages:
- English
- ISBNs:
- 9783319182636
3319182633 - Related ISBNs:
- 9783319182629
- Notes:
- Note: Online resource; title from PDF title page (SpringerLink, viewed May 5, 2015).
- Access Rights:
- Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
- Access Usage:
- Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD.DS.369873
- Ingest File:
- 01_353.xml