Show indexed articles as search result.

The articles of this volume will be reviewed individually. The preceding workshop has been reviewed (see Zbl 1186.68002).
Indexed articles:
Anshelevich, Elliot; Caskurlu, Bugra; Hate, Ameya, Strategic multiway cut and multicut games, 1-12 [Zbl 1314.91049]
Antonakopoulos, Spyridon, Approximating directed buy-at-bulk network design, 13-24 [Zbl 1314.68212]
Balogh, János; Békési, József; Galambos, Gábor, New lower bounds for certain classes of bin packing algorithms, 25-36 [Zbl 1314.68141]
Bordewich, Magnus, On the approximation complexity hierarchy, 37-46 [Zbl 1314.68137]
Briest, Patrick; Röglin, Heiko, The power of uncertainty: bundle-pricing for unit-demand customers, 47-58 [Zbl 1314.91159]
Chan, Ho-Leung; Lam, Tak-Wah; Li, Rongbin, Tradeoff between energy and throughput for online deadline scheduling, 59-70 [Zbl 1314.68405]
Chekuri, Chandra; Gal, Avigdor; Im, Sungjin; Khuller, Samir; Li, Jian; McCutchen, Richard; Moseley, Benjamin; Raschid, Louiqa, New models and algorithms for throughput maximization in broadcast scheduling (extended abstract), 71-82 [Zbl 1314.68406]
Chen, Danny Z.; Fleischer, Rudolf; Li, Jian, Densest \(k\)-subgraph approximation on intersection graphs, 83-93 [Zbl 1314.68393]
Das, Aparna; Mathieu, Claire; Mozes, Shay, The train delivery problem – vehicle routing meets bin packing, 94-105 [Zbl 1314.68394]
Dressler, Daniel; Skutella, Martin, An FPTAS for flows over time with aggregate arc capacities, 106-117 [Zbl 1314.68395]
Ehmsen, Martin R.; Kohrt, Jens S.; Larsen, Kim S., List factoring and relative worst order analysis, 118-129 [Zbl 1314.68409]
Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M., Approximation algorithms for domination search, 130-141 [Zbl 1314.68396]
Jagtenberg, Caroline; Schwiegelshohn, Uwe; Uetz, Marc, Lower bounds for Smith’s rule in stochastic machine scheduling, 142-153 [Zbl 1314.90044]
Kamma, Lior; Nutov, Zeev, Approximating survivable networks with minimum number of Steiner points, 154-165 [Zbl 1314.68399]
Karrenbauer, Andreas; Rothvoß, Thomas, A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks, 166-177 [Zbl 1314.68400]
Lam, Tak-Wah; Liu, Chi-Man; Ting, Hing-Fung, Online tracking of the dominance relationship of distributed multi-dimensional data, 178-189 [Zbl 1314.68411]
Makarychev, Konstantin; Makarychev, Yury, How to play unique games on expanders, 190-200 [Zbl 1314.68401]
Mathieu, Claire; Vladu, Adrian, Online ranking for tournament graphs, 201-212 [Zbl 1314.68413]
Peis, Britta; Wiese, Andreas, Throughput maximization for periodic packet routing on trees and grids, 213-224 [Zbl 1314.68094]
Pritchard, David, \(k\)-edge-connectivity: approximation and LP relaxation, 225-236 [Zbl 1314.68402]
Pruhs, Kirk; Robert, Julien; Schabanel, Nicolas, Minimizing maximum flowtime of jobs with arbitrary parallelizability, 237-248 [Zbl 1314.90040]
van Stee, Rob, An improved algorithm for online rectangle filling, 249-260 [Zbl 1314.90042]
Yamakami, Tomoyuki, Approximate counting for complex-weighted Boolean constraint satisfaction problems, 261-272 [Zbl 1314.68166]