Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar15th WAOA 2017: Vienna, Austria
Roberto Solis-Oba, Rudolf Fleischer:
Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10787, Springer 2018, ISBN 978-3-319-89440-9- Paz Carmi, Matthew J. Katz, Rachel Saban, Yael Stein:
Improved PTASs for Convex Barrier Coverage. 26-40 - Soroush Alamdari, David B. Shmoys:
A Bicriteria Approximation Algorithm for the k-Center and k-Median Problems. 66-75 - Naoyuki Kamiyama:
Submodular Function Minimization with Submodular Set Covering Constraints and Precedence Constraints. 90-101 - János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Lower Bounds for Several Online Variants of Bin Packing. 102-117 - Mário César San Felice, Cristina G. Fernandes, Carla Negri Lintzmayer:
The Online Multicommodity Connected Facility Location Problem. 118-131 - Marcin Bienkowski, Artur Kraska, Pawel Schmidt:
A Match in Time Saves Nine: Deterministic Online Matching with Delays. 132-146 - Antonios Antoniadis, Kevin Schewior:
A Tight Lower Bound for Online Convex Optimization with Switching Costs. 164-175 - Abhijin Adiga, Alexander D. Friedman, Sharath Raghvendra:
A k-Median Based Online Algorithm for the Stochastic k-Server Problem. 176-189 - Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý:
On Packet Scheduling with Adversarial Jamming and Speedup. 190-206 - Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers:
Non-clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times. 207-222 - Allan Borodin, Denis Pankratov, Amirali Salehi-Abari:
On Conceptually Simple Algorithms for Variants of Online Bipartite Matching. 253-268 - Itay Laish, Shay Mozes:
Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs. 269-284 - Felix Biermeier, Björn Feldkord, Manuel Malatyali, Friedhelm Meyer auf der Heide:
A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries. 285-300 - Michele Flammini, Gianpiero Monaco, Qiang Zhang:
Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games. 301-316 - Jasper de Jong, Walter Kern, Berend Steenhuisen, Marc Uetz:
The Asymptotic Price of Anarchy for k-uniform Congestion Games. 317-328
maintained by 
, founded at 
, founded at 
last updated on 2019-02-17 19:15 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
