WAOA B

23 papers

YearTitle / Authors
2012Approximation and Online Algorithms - 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers
Roberto Solis-Oba, Giuseppe Persiano
2011A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption.
Tomás Ebenlendr, Jirí Sgall
2011A New Perspective on List Update: Probabilistic Locality and Working Set.
Reza Dorrigiv, Alejandro López-Ortiz
2011An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems.
Wolfgang W. Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito, Shoji Kasahara, Jun Kawahara
2011Approximating Subset k-Connectivity Problems.
Zeev Nutov
2011Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat.
David B. Shmoys, Gwen Spencer
2011Approximation Algorithms for Scheduling and Packing Problems.
Klaus Jansen
2011Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs.
Nadine Schwartges, Joachim Spoerhase, Alexander Wolff
2011Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems.
Cristina Bazgan, Laurent Gourvès, Jérôme Monnot
2011Competitive Router Scheduling with Structured Data.
Yishay Mansour, Boaz Patt-Shamir, Dror Rawitz
2011Faster and Simpler Approximation of Stable Matchings.
Katarzyna E. Paluch
2011Generalized Maximum Flows over Time.
Martin Groß, Martin Skutella
2011Improved Lower Bound for Online Strip Packing - (Extended Abstract).
Rolf Harren, Walter Kern
2011Learning in Stochastic Machine Scheduling.
Sebastián Marbán, Cyriel Rutten, Tjark Vredeveld
2011Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models.
Jianqiao Zhu, Ho-Leung Chan, Tak Wah Lam
2011On Online Algorithms with Advice for the k-Server Problem.
Marc P. Renault, Adi Rosén
2011OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm.
Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu
2011Optimization over Integers with Robustness in Cost and Few Constraints.
Kai-Simon Goetzmann, Sebastian Stiller, Claudio Telha
2011Parameterized Approximation Algorithms for Hitting Set.
Ljiljana Brankovic, Henning Fernau
2011Scheduling Jobs on Identical and Uniform Processors Revisited.
Klaus Jansen, Christina Robenek
2011Simpler 3/4-Approximation Algorithms for MAX SAT.
Anke van Zuylen
2011Single Approximation for Biobjective Max TSP.
Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual
2011The Price of Anarchy for Minsum Related Machine Scheduling.
Ruben Hoeksma, Marc Uetz