Issue 1/2016
Approximation and Online Algorithms
Content (10 Articles)
Foreword of the Special Issue Dedicated to the 2013 Workshop on Approximation and Online Algorithms
Christos Kaklamanis, Kirk Pruhs
Open Access
Improved Approximation Algorithm for k-level Uncapacitated Facility Location Problem (with Penalties)
Jaroslaw Byrka, Shanfei Li, Bartosz Rybicki
Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs
Matúš Mihalák, Rastislav Šrámek, Peter Widmayer
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Approximating the Sparsest k-Subgraph in Chordal Graphs
Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau
On Two Continuum Armed Bandit Problems in High Dimensions
Hemant Tyagi, Sebastian U. Stich, Bernd Gärtner