Volume 58, Issue 1

January 2016

Approximation and Online Algorithms

Issue Editors:

10 articles in this issue

Foreword of the Special Issue Dedicated to the 2013 Workshop on Approximation and Online Algorithms
Christos Kaklamanis
Kirk Pruhs
EditorialNotes 08 April 2015 Pages: 1 - 3
On Fixed Cost k-Flow Problems
MohammadTaghi Hajiaghayi
Rohit Khandekar
Zeev Nutov
OriginalPaper 12 September 2014 Pages: 4 - 18
Improved Approximation Algorithm for k-level Uncapacitated Facility Location Problem (with Penalties)
Jaroslaw Byrka
Shanfei Li
Bartosz Rybicki
OriginalPaper Open access 04 November 2014 Pages: 19 - 44
Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs
Matúš Mihalák
Rastislav Šrámek
Peter Widmayer
OriginalPaper 18 September 2014 Pages: 45 - 59
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation
Yuichi Asahiro
Jesper Jansson
Hirotaka Ono
OriginalPaper 19 December 2014 Pages: 60 - 93
Min-Sum 2-Paths Problems
Trevor Fenner
Oded Lachish
Alexandru Popa
OriginalPaper 17 September 2014 Pages: 94 - 110
Approximating the Sparsest k-Subgraph in Chordal Graphs
Rémi Watrigant
Marin Bougeret
Rodolphe Giroudeau
OriginalPaper 13 September 2014 Pages: 111 - 132
Low Dimensional Embeddings of Doubling Metrics
Ofer Neiman
OriginalPaper 05 September 2014 Pages: 133 - 152
Online Knapsack Revisited
Marek Cygan
Łukasz Jeż
Jiří Sgall
OriginalPaper Open access 09 November 2014 Pages: 153 - 190
On Two Continuum Armed Bandit Problems in High Dimensions
Hemant Tyagi
Sebastian U. Stich
Bernd Gärtner
OriginalPaper 12 September 2014 Pages: 191 - 222

Search