04431cam a2200457 i 450000547403720210614093934.0m o d cr n 120229s2012 gw a ob 101 0 eng d201293437297836422911593642291155(WaSeSS)ssj0000665947DLCengDLCDLCWaSeSSrdapccQA76.9.A43W42 2011005.123WAOA 2011(2011 :Saarbrücken, Germany)http://share-vde.org/sharevde/rdfBibframe/Agent/2137947http://id.loc.gov/authorities/names/nb2012009930Approximation and online algorithms :9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, revised selected papers /Roberto Solis-Oba, Giuseppe Persiano (Eds.).WAOA 2011Heidelberg ;New York :Springer,[2012]http://share-vde.org/sharevde/rdfBibframe/Publisher/181 online resource (x, 273 pages) :illustrationstexttxtrdacontenthttp://rdaregistry.info/termList/RDAContentType/1020computercrdamediahttp://rdaregistry.info/termList/RDAMediaType/1002online resourcecrrdacarrierhttp://rdaregistry.info/termList/RDACarrierType/1018Lecture notes in computer science,0302-9743 ;7164LNCS sublibrary. SL 1, Theoretical computer science and general issuesDescription based on print version record.Includes bibliographical references and author index.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.Online algorithmsCongresses.Approximation algorithmsCongresses.Electronic books.Solis-Oba, Roberto,editor.http://isni.org/isni/0000000114911073Persiano, Giuseppe.,editor.http://isni.org/isni/0000000114688246http://rdaregistry.info/Elements/m/P30004http://worldcat.org/oclc/0000665947Print version:WAOA 2011 (2011 : Saarbrücken, Germany)Approximation and online algorithms97836422911593642291155(DLC) 2012934372Full text available from Springer Computer Science eBooks 2012 English/Internationalhttps://login.proxy.lib.duke.edu/login?url=https://link.springer.com/10.1007/978-3-642-29116-6ssj0000665947Library of CongressApproximation and online algorithmshttp://share-vde.org/sharevde/rdfBibframe/Work/3323862-1DUKE