default search action
9. WAOA 2011: Saarbrücken, Germany
- Roberto Solis-Oba, Giuseppe Persiano:
Approximation and Online Algorithms - 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7164, Springer 2012, ISBN 978-3-642-29115-9 - Klaus Jansen:
Approximation Algorithms for Scheduling and Packing Problems. 1-8 - Zeev Nutov:
Approximating Subset k-Connectivity Problems. 9-20 - Sebastián Marbán, Cyriel Rutten, Tjark Vredeveld:
Learning in Stochastic Machine Scheduling. 21-34 - Wolfgang W. Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito, Shoji Kasahara
, Jun Kawahara:
An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems. 35-48 - Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual:
Single Approximation for Biobjective Max TSP. 49-62 - Ljiljana Brankovic
Parameterized Approximation Algorithms for Hitting Set. 63-76 - Nadine Schwartges, Joachim Spoerhase
Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs. 77-88 - Kai-Simon Goetzmann, Sebastian Stiller, Claudio Telha:
Optimization over Integers with Robustness in Cost and Few Constraints. 89-101 - Tomás Ebenlendr, Jirí Sgall
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption. 102-108 - Klaus Jansen, Christina Robenek:
Scheduling Jobs on Identical and Uniform Processors Revisited. 109-122 - David B. Shmoys, Gwen Spencer:
Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat. 123-136 - Jianqiao Zhu, Ho-Leung Chan, Tak Wah Lam
Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models. 137-149 - Reza Dorrigiv, Alejandro López-Ortiz:
A New Perspective on List Update: Probabilistic Locality and Working Set. 150-163 - Gerth Stølting Brodal
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. 164-175 - Katarzyna E. Paluch
Faster and Simpler Approximation of Stable Matchings. 176-187 - Anke van Zuylen:
Simpler 3/4-Approximation Algorithms for MAX SAT. 188-197 - Marc P. Renault
On Online Algorithms with Advice for the k-Server Problem. 198-210 - Rolf Harren, Walter Kern:
Improved Lower Bound for Online Strip Packing - (Extended Abstract). 211-218 - Yishay Mansour, Boaz Patt-Shamir, Dror Rawitz:
Competitive Router Scheduling with Structured Data. 219-232 - Cristina Bazgan, Laurent Gourvès, Jérôme Monnot:
Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems. 233-246 - Martin Groß, Martin Skutella:
Generalized Maximum Flows over Time. 247-260 - Ruben Hoeksma
The Price of Anarchy for Minsum Related Machine Scheduling. 261-273
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-26 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: