/LC.GIF&client=easterncarolinaedu)
Approximation and online algorithms 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, revised selected papers / Roberto Solis-Oba, Giuseppe Persiano (Eds.).
| Author/creator | WAOA 2011 |
| Other author | Solis-Oba, Roberto. |
| Other author | Persiano, Giuseppe. |
| Format | Electronic |
| Publication Info | Heidelberg ; New York : Springer, [2012] |
| Description | x, 273 pages : illustrations ; 24 cm. |
| Supplemental Content | Full text available from Springer Books |
| Supplemental Content | Full text available from Springer Nature - Springer Computer Science eBooks 2012 English International |
| Supplemental Content | Full text available from SpringerLINK Lecture Notes in Computer Science Contemporary (1997-present) |
| Subjects |
| Variant title | WAOA 2011 |
| Series | Lecture notes in computer science, 0302-9743 ; 7164 LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Contents | Approximation Algorithms for Scheduling and Packing Problems / Klaus Jansen -- Approximating Subset k-Connectivity Problems / Zeev Nutov -- Learning in Stochastic Machine Scheduling / Sebastiâan Marbâan, Cyriel Rutten and Tjark Vredeveld -- An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems / Wolfgang Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito and Shoji Kasahara, et al. -- Single Approximation for Biobjective Max TSP / Cristina Bazgan, Laurent Gourváes, Jâerãome Monnot and Fanny Pascual -- Parameterized Approximation Algorithms for Hitting Set / Ljiljana Brankovic and Henning Fernau -- Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs / Nadine Schwartges, Joachim Spoerhase and Alexander Wolff -- Optimization over Integers with Robustness in Cost and Few Constraints / Kai-Simon Goetzmann, Sebastian Stiller and Claudio Telha -- A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption / Tomâaés Ebenlendr and Jiérâi Sgall -- Scheduling Jobs on Identical and Uniform Processors Revisited / Klaus Jansen and Christina Robenek. |
| Contents | Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat / David B. Shmoys and Gwen Spencer -- Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models / Jianqiao Zhu, Ho-Leung Chan and Tak-Wah Lam -- A New Perspective on List Update: Probabilistic Locality and Working Set / Reza Dorrigiv and Alejandro Lâopez-Ortiz -- OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm / Gerth St2lting Brodal, Gabriel Moruz and Andrei Negoescu -- Faster and Simpler Approximation of Stable Matchings / Katarzyna Paluch -- Simpler 3/4-Approximation Algorithms for MAX SAT / Anke van Zuylen -- On Online Algorithms with Advice for the k-Server Problem / Marc P. Renault and Adi Rosâen -- Improved Lower Bound for Online Strip Packing / (Extended Abstract) / Rolf Harren and Walter Kern -- Competitive Router Scheduling with Structured Data / Yishay Mansour, Boaz Patt-Shamir and Dror Rawitz -- Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems / Cristina Bazgan, Laurent Gourváes and Jâerãome Monnot -- Generalized Maximum Flows over Time / Martin GroÇ and Martin Skutella -- The Price of Anarchy for Minsum Related Machine Scheduling / Ruben Hoeksma and Marc Uetz. |
| Bibliography note | Includes bibliographical references and author index. |
| Access restriction | Available only to authorized users. |
| Technical details | Mode of access: World Wide Web |
| Genre/form | Electronic books. |
| LCCN | 2012934372 |
| ISBN | 9783642291159 (soft cover : alk. paper) |
| ISBN | 3642291155 (soft cover : alk. paper) |
Availability
| Library | Location | Call Number | Status | Item Actions |
|---|---|---|---|---|
| Electronic Resources | ✔ Available |