Theory Comput Syst (2018) 62:247–248 https://doi.org/10.1007/s00224-018-9850-9 1 2 Laura Sanita ` · Martin Skutella Published online: 8 February 2018 © Springer Science+Business Media, LLC, part of Springer Nature 2018 This special issue of Theory of Computing Systems is devoted to selected papers from the 13th Workshop on Approximation and Online Algorithms (WAOA 2015), that took place in Patras, Greece, in September 2015. The guest editors selected 9 contributions presented at the conference, addressing fundamental topics related to approximation and online algorithms, which have been revised and expanded in this special issue. In their article Constant-Time Local Computation Algorithms, Yishay Mansour, Boaz Patt-Shamir, and Shai Vardi give Local Computation Algorithms for several combinatorial optimization problems, whose time complexity is independent of the input size. Sandor ` P. Fekete, Kan Huang, Joseph S. B. Mitchell, Ojas Parekh, and Cynthia A. Phillips, in their contribution Geometric Hitting Set for Segments of Few Ori- entations, give new hardness and approximation results for several special cases of geometric hitting set problems, where the input consists of sets of line segments having a small number of distinct slopes. In their paper Scheduling Parallel Jobs Online with Convex and Concave Paral- lelizability, Roozbeh Ebrahimi, Samuel McCauley,
Theory of Computing Systems – Springer Journals
Published: Feb 8, 2018
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.
All for just $49/month
It’s easy to organize your research with our built-in tools.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud