Abstract is missing.
- Approximation Algorithms for Scheduling and Packing ProblemsKlaus Jansen. 1-8 [doi]
- Approximating Subset k-Connectivity ProblemsZeev Nutov. 9-20 [doi]
- Learning in Stochastic Machine SchedulingSebastián Marbán, Cyriel Rutten, Tjark Vredeveld. 21-34 [doi]
- An Online Algorithm Optimally Self-tuning to Congestion for Power Management ProblemsWolfgang W. Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito, Shoji Kasahara, Jun Kawahara. 35-48 [doi]
- Single Approximation for Biobjective Max TSPCristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual. 49-62 [doi]
- Parameterized Approximation Algorithms for Hitting SetLjiljana Brankovic, Henning Fernau. 63-76 [doi]
- Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic DigraphsNadine Schwartges, Joachim Spoerhase, Alexander Wolff. 77-88 [doi]
- Optimization over Integers with Robustness in Cost and Few ConstraintsKai-Simon Goetzmann, Sebastian Stiller, Claudio Telha. 89-101 [doi]
- A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without PreemptionTomás Ebenlendr, Jiri Sgall. 102-108 [doi]
- Scheduling Jobs on Identical and Uniform Processors RevisitedKlaus Jansen, Christina Robenek. 109-122 [doi]
- Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located ThreatDavid B. Shmoys, Gwen Spencer. 123-136 [doi]
- Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor ModelsJianqiao Zhu, Ho-Leung Chan, Tak Wah Lam. 137-149 [doi]
- A New Perspective on List Update: Probabilistic Locality and Working SetReza Dorrigiv, Alejandro López-Ortiz. 150-163 [doi]
- OnlineMin: A Fast Strongly Competitive Randomized Paging AlgorithmGerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu. 164-175 [doi]
- Faster and Simpler Approximation of Stable MatchingsKatarzyna E. Paluch. 176-187 [doi]
- Simpler 3/4-Approximation Algorithms for MAX SATAnke van Zuylen. 188-197 [doi]
- On Online Algorithms with Advice for the k-Server ProblemMarc P. Renault, Adi Rosén. 198-210 [doi]
- Improved Lower Bound for Online Strip Packing - (Extended Abstract)Rolf Harren, Walter Kern. 211-218 [doi]
- Competitive Router Scheduling with Structured DataYishay Mansour, Boaz Patt-Shamir, Dror Rawitz. 219-232 [doi]
- Approximation with a Fixed Number of Solutions of Some Biobjective Maximization ProblemsCristina Bazgan, Laurent Gourvès, Jérôme Monnot. 233-246 [doi]
- Generalized Maximum Flows over TimeMartin Groß, Martin Skutella. 247-260 [doi]
- The Price of Anarchy for Minsum Related Machine SchedulingRuben Hoeksma, Marc Uetz. 261-273 [doi]