LEADER 06222nam 22007575 450 001 996466000103316 005 20230221204448.0 010 $a3-642-29116-3 024 7 $a10.1007/978-3-642-29116-6 035 $a(CKB)3360000000365982 035 $a(SSID)ssj0000665947 035 $a(PQKBManifestationID)11402169 035 $a(PQKBTitleCode)TC0000665947 035 $a(PQKBWorkID)10646234 035 $a(PQKB)10224614 035 $a(DE-He213)978-3-642-29116-6 035 $a(MiAaPQ)EBC3070960 035 $a(PPN)168313723 035 $a(EXLCZ)993360000000365982 100 $a20120326d2012 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aApproximation and Online Algorithms$b[electronic resource] $e9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers /$fedited by Roberto Solis-Oba, Giuseppe Persiano 205 $a1st ed. 2012. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2012. 215 $a1 online resource (X, 278 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7164 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-29115-5 320 $aIncludes bibliographical references and author index. 327 $tApproximation Algorithms for Scheduling and Packing Problems /$rKlaus Jansen --$tApproximating Subset k-Connectivity Problems /$rZeev Nutov --$tLearning in Stochastic Machine Scheduling /$rSebastia?an Marba?an, Cyriel Rutten and Tjark Vredeveld --$tAn Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems /$rWolfgang Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito and Shoji Kasahara, et al. --$tSingle Approximation for Biobjective Max TSP /$rCristina Bazgan, Laurent Gourva?es, Ja?era?ome Monnot and Fanny Pascual --$tParameterized Approximation Algorithms for Hitting Set /$rLjiljana Brankovic and Henning Fernau --$tApproximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs /$rNadine Schwartges, Joachim Spoerhase and Alexander Wolff --$tOptimization over Integers with Robustness in Cost and Few Constraints /$rKai-Simon Goetzmann, Sebastian Stiller and Claudio Telha --$tA Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption /$rToma?ae?s Ebenlendr and Jie?ra?i Sgall --$tScheduling Jobs on Identical and Uniform Processors Revisited /$rKlaus Jansen and Christina Robenek. 327 $tApproximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat /$rDavid B. Shmoys and Gwen Spencer --$tNon-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models /$rJianqiao Zhu, Ho-Leung Chan and Tak-Wah Lam --$tA New Perspective on List Update: Probabilistic Locality and Working Set /$rReza Dorrigiv and Alejandro La?opez-Ortiz --$tOnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm /$rGerth St²lting Brodal, Gabriel Moruz and Andrei Negoescu --$tFaster and Simpler Approximation of Stable Matchings /$rKatarzyna Paluch --$tSimpler 3/4-Approximation Algorithms for MAX SAT /$rAnke van Zuylen --$tOn Online Algorithms with Advice for the k-Server Problem /$rMarc P. Renault and Adi Rosa?en --$tImproved Lower Bound for Online Strip Packing /$r(Extended Abstract) /$rRolf Harren and Walter Kern --$tCompetitive Router Scheduling with Structured Data /$rYishay Mansour, Boaz Patt-Shamir and Dror Rawitz --$tApproximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems /$rCristina Bazgan, Laurent Gourva?es and Ja?era?ome Monnot --$tGeneralized Maximum Flows over Time /$rMartin GroC? and Martin Skutella --$tThe Price of Anarchy for Minsum Related Machine Scheduling /$rRuben Hoeksma and Marc Uetz. 330 $aThis book constitutes the thoroughly refereed post-proceedings of the 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, held in Saarbrücken, Germany, in September 2011. The 21 papers presented were carefully reviewed and selected from 48 submissions. The volume also contains an extended abstract of the invited talk of Prof. Klaus Jansen. The Workshop on Approximation and Online Algorithms focuses on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications in a wide variety of fields. Topics of interest for WAOA 2011 were: algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized complexity, randomization techniques and scheduling problems. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7164 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aComputer graphics 606 $aApplication software 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aComputer Graphics 606 $aComputer and Information Systems Applications 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aComputer graphics. 615 0$aApplication software. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 615 24$aComputer Graphics. 615 24$aComputer and Information Systems Applications. 676 $a005.1 702 $aSolis-Oba$b Roberto$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPersiano$b Giuseppe$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466000103316 996 $aApproximation and Online Algorithms$92954916 997 $aUNISA