Vai al contenuto principale della pagina

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.).

(Visualizza formato Marc21)    (visualizza in BIBRAME 2.0)

Creatore: WAOA 2011 (2011 : Saarbrücken, Germany)
Titolo: 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.).
Link to work: Approximation and online algorithms Visualizza cluster
Pubblicazione: Heidelberg ; New York : Springer, [2012]
Estensione: 1 online resource (x, 273 pages) : illustrations
Tipo formato: computer
Tipo contenuto: text
Tipo supporto: online resource
Disciplina: 005.1
Genere/Forma: Electronic books
Classificazione LOC: QA76.9.A43 W42 2011
Creatori/Collaboratori: Solis-Oba, Roberto, [editor.]
Persiano, Giuseppe., [editor.]
Note generali: Description based on print version record.
Contenuto supplementare: Includes bibliographical references and author index.
Nota di contenuto: 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.
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 St²lting 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.
Collana: Lecture notes in computer science, 0302-9743 ; 7164
LNCS sublibrary. SL 1, Theoretical computer science and general issues
Varianti del titolo: WAOA 2011
ISBN: 9783642291159
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 005474037
Localizzazioni e accesso elettronico
Lo trovi qui: Duke University
Item: Permalink to OPAC
Altra ed. diverso supporto: Print version: WAOA 2011 (2011 : Saarbrücken, Germany) Approximation and online algorithms 9783642291159 3642291155 (DLC) 2012934372