Approximation and Online Algorithms: 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers PDF
Preview Approximation and Online Algorithms: 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers
Lecture Notes in Computer Science 6534 CommencedPublicationin1973 FoundingandFormerSeriesEditors: GerhardGoos,JurisHartmanis,andJanvanLeeuwen EditorialBoard DavidHutchison LancasterUniversity,UK TakeoKanade CarnegieMellonUniversity,Pittsburgh,PA,USA JosefKittler UniversityofSurrey,Guildford,UK JonM.Kleinberg CornellUniversity,Ithaca,NY,USA AlfredKobsa UniversityofCalifornia,Irvine,CA,USA FriedemannMattern ETHZurich,Switzerland JohnC.Mitchell StanfordUniversity,CA,USA MoniNaor WeizmannInstituteofScience,Rehovot,Israel OscarNierstrasz UniversityofBern,Switzerland C.PanduRangan IndianInstituteofTechnology,Madras,India BernhardSteffen TUDortmundUniversity,Germany MadhuSudan MicrosoftResearch,Cambridge,MA,USA DemetriTerzopoulos UniversityofCalifornia,LosAngeles,CA,USA DougTygar UniversityofCalifornia,Berkeley,CA,USA GerhardWeikum MaxPlanckInstituteforInformatics,Saarbruecken,Germany Klaus Jansen Roberto Solis-Oba (Eds.) Approximation and Online Algorithms 8th International Workshop, WAOA 2010 Liverpool, UK, September 9-10, 2010 Revised Papers 1 3 VolumeEditors KlausJansen UniversityofKiel,DepartmentofComputerScience Olshausenstrasse40,24118Kiel,Germany E-mail:[email protected] RobertoSolis-Oba TheUniversityofWesternOntario,DepartmentofComputerScience London,OntarioN6A5B7,Canada E-mail:[email protected] ISSN0302-9743 e-ISSN1611-3349 ISBN978-3-642-18317-1 e-ISBN978-3-642-18318-8 DOI10.1007/978-3-642-18318-8 SpringerHeidelbergDordrechtLondonNewYork LibraryofCongressControlNumber:2010942454 CRSubjectClassification(1998):F.2.2,G.2.1-2,G.1.2,G.1.6,E.1,C.2,I.3.5 LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues ©Springer-VerlagBerlinHeidelberg2011 Thisworkissubjecttocopyright.Allrightsarereserved,whetherthewholeorpartofthematerialis concerned,specificallytherightsoftranslation,reprinting,re-useofillustrations,recitation,broadcasting, reproductiononmicrofilmsorinanyotherway,andstorageindatabanks.Duplicationofthispublication orpartsthereofispermittedonlyundertheprovisionsoftheGermanCopyrightLawofSeptember9,1965, initscurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Violationsareliable toprosecutionundertheGermanCopyrightLaw. Theuseofgeneraldescriptivenames,registerednames,trademarks,etc.inthispublicationdoesnotimply, evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevantprotectivelaws andregulationsandthereforefreeforgeneraluse. Typesetting:Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India Printedonacid-freepaper SpringerispartofSpringerScience+BusinessMedia(www.springer.com) Klaus Jansen Roberto Solis-Oba (Eds.) Approximation and Online Algorithms 8th International Workshop, WAOA 2010 Liverpool, UK, September 9-10, 2010 Revised Papers 1 3 Organization Program Co-chairs Klaus Jansen University of Kiel, Germany Roberto Solis-Oba University of Western Ontario, Canada Program Committee Klaus Jansen (Co-chair) University of Kiel, Germany Roberto Solis-Oba (Co-chair) University of Western Ontario, Canada Evripidis Bampis University of Evry, France Jianer Chen Texas A&M University, USA Jose Correa Universidad de Chile, Chile Khaled Elbassioni Max Planck Institut fu¨r Informatik, Germany Rudolf Fleischer Fudan University, China Thomas Erlebach University of Leicester, UK Martin Fu¨rer The Pennsylvania State University, USA Christos Kaklamanis University of Patras,Greece Jochen K¨onemann University of Waterloo, Canada Stefano Leonardi Sapienza University of Rome, Italy Alejandro Lo´pez-Ortiz University of Waterloo, Canada Monaldo Mastrolilli IDSIA Lugano, Switzerland Hadas Shachnai Israel Institute of Technology,Israel Martin Skutella TU Berlin, Germany Clifford Stein Columbia University, USA Denis Trystram Grenoble Institute of Technology, France Additional Referees Sivan Albagli Daniel Cordeiro Susanne Albers Andy Curtis Eric Angel Reza Dorrigiv Stavros Athanassopoulos Christoph Du¨rr Nikhil Bansal Stephane Durocher Vincenzo Bonifaci Leah Epstein Marin Bougeret Bruno Escoffier Mohamed Slim Bouguerra Samuel Fiorini David Bunde Mohamoud Fouz Chandra Chekuri Robert Fraser Ning Chen Hiroshi Fujiwara Janka Chlebikova Leslie Ann Goldberg VIII Organization Laurent Gourves Zeev Nutov Fabrizio Grandoni Christina Otte Martin Groß Andrea Pacifici Inge Li Gørtz Evi Papaioannou Angele Hamel Ojas Parekh Martin Hoefer Fanny Pascual Riko Jacob David Pritchard Panagiotis Kanellopoulos Kirk Pruhs Nikos Karanikolas Lars Pr¨adel Hans Kellerer Claude-Guy Quimper Alexandra Kolla Rajiv Raman Ravishankar Krishnaswamy Thomas Rothvoss Sven Krumke Alejandro Salinger Piotr Krysta Ulrich M. Schwarz Raghav Kulkarni Rene Sitters Maria Kyropoulou Alexander Souza Van Bang Le Georgios Stamoulis Lap-Kei Lee Sebastian Stiller Dimitris Letsios Martin Strauss Asaf Levin Zoya Svitkina Martin Matamala Tami Tamir Vardges Melkonian Nicolas Thibault Nikola Milosavljevic Marc Uetz Vahab Mirrokni Rob van Stee Jerome Monnot Anke van Zuylen Luca Moscardelli Jos´e Verschae Benjamin Moseley Tjark Vredeveld Gregory Mounie Andreas Wiese Alantha Newman Prudence W.H. Wong Kim Thang Nguyen Table of Contents WAOA 2010 Strategic Multiway Cut and Multicut Games ........................ 1 Elliot Anshelevich, Bugra Caskurlu, and Ameya Hate Approximating Directed Buy-at-Bulk Network Design ................ 13 Spyridon Antonakopoulos New Lower Bounds for Certain Classes of Bin Packing Algorithms ..... 25 J´anos Balogh, Jo´zsef B´ek´esi, and G´abor Galambos On the Approximation Complexity Hierarchy........................ 37 Magnus Bordewich The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers ...................................................... 47 Patrick Briest and Heiko R¨oglin Tradeoff between Energy and Throughput for Online Deadline Scheduling ...................................................... 59 Ho-Leung Chan, Tak-Wah Lam, and Rongbin Li New Models and Algorithms for Throughput Maximization in BroadcastScheduling (Extended Abstract).......................... 71 Chandra Chekuri, Avigdor Gal, Sungjin Im, Samir Khuller, Jian Li, Richard McCutchen, Benjamin Moseley, and Louiqa Raschid Densest k-Subgraph Approximation on Intersection Graphs ........... 83 Danny Z. Chen, Rudolf Fleischer, and Jian Li The Train Delivery Problem – Vehicle Routing Meets Bin Packing ..... 94 Aparna Das, Claire Mathieu, and Shay Mozes An FPTAS for Flows over Time with Aggregate Arc Capacities........ 106 Daniel Dressler and Martin Skutella List Factoring and Relative Worst Order Analysis.................... 118 Martin R. Ehmsen, Jens S. Kohrt, and Kim S. Larsen Approximation Algorithms for Domination Search.................... 130 Fedor V. Fomin, Petr A. Golovach, and Dimitrios M. Thilikos Lower Bounds for Smith’s Rule in Stochastic Machine Scheduling ...... 142 Caroline Jagtenberg, Uwe Schwiegelshohn, and Marc Uetz X Table of Contents Approximating Survivable Networks with Minimum Number of Steiner Points .......................................................... 154 Lior Kamma and Zeev Nutov A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks .............................. 166 Andreas Karrenbauer and Thomas Rothvoß Online Tracking of the Dominance Relationship of Distributed Multi-dimensional Data........................................... 178 Tak-Wah Lam, Chi-Man Liu, and Hing-Fung Ting How to Play Unique Games on Expanders .......................... 190 Konstantin Makarychev and Yury Makarychev Online Ranking for Tournament Graphs ............................ 201 Claire Mathieu and Adrian Vladu Throughput Maximization for Periodic Packet Routing on Trees and Grids........................................................... 213 Britta Peis and Andreas Wiese k-Edge-Connectivity:Approximation and LP Relaxation.............. 225 David Pritchard Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability.................................................. 237 Kirk Pruhs, Julien Robert, and Nicolas Schabanel An Improved Algorithm for Online Rectangle Filling ................. 249 Rob van Stee Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems............................................. 261 Tomoyuki Yamakami Author Index.................................................. 273 (cid:2) Strategic Multiway Cut and Multicut Games Elliot Anshelevich, Bugra Caskurlu, and Ameya Hate Department of Computer Science, Rensselaer Polytechnic Institute,Troy, NY Abstract. Weconsidercutgameswhereplayerswanttocutthemselves off from different parts of a network. These games arise when players wanttosecurethemselvesfromareasofpotentialinfection.Forthegame- theoreticversionofMultiwayCut,weprovethatthepriceofstabilityis1, i.e.,thereexistsaNashequilibriumasgoodasthecentralizedoptimum. For the game-theoretic version of Multicut, we show that there exists a 2-approximateequilibrium asgood as thecentralized optimum.Wealso give poly-time algorithms for finding exact and approximate equilibria in thesegames. 1 Introduction and Model Networked systems for transport, communication, and social interaction have contributed to all aspects of life by increasing economic and social efficiency. However,increasedconnectivityalsogivesintrudersandattackersbetter oppor- tunities to maliciously spread in the network, whether the spread is of disin- formation, or of contamination in the water supply [26]. Anyone participating in a networked system may therefore desire to undertake appropriate security measures in order to protect themselves from such malicious influences. We introduce a Network Cutting Game, which is a game-theoreticframework whereagroupofself-interestedplayersprotectverticesthattheyownbycutting them off from parts of the network that they find untrustworthy. Cutting an edge should not be interpreted as destroying a part of the network: instead it cancorrespondtotakingsecuritymeasuresonthatedgesuchasplacingsentries on lines of communication. These notions are applicable in areas such as airline security. Consider a situation where country A requires extra security screening ofpassengersorcargofromcountryB.Duetothenetworkedmulti-hopstructure ofinternationalairtravel,the optimallocationsforcarryingoutsuchscreenings may lie somewhere in between the two countries. In general, the goal of each player is to make sure that nothing can get to it from an “untrustworthy” part ofthenetworkwithoutpassingthroughanedgewithinstalledsecuritymeasures. The purpose of each player is to protect themselves while spending as little money as possible for their security.We investigatethe efficiency of the security actions taken by a group of agents by studying the price of anarchy and the price of stability — the ratios between the costs of the worst and best Nash (cid:2) This work supported in part by NSFCCF-0914782. K.JansenandR.Solis-Oba(Eds.):WAOA2010,LNCS6534,pp.1–12,2011. (cid:2)c Springer-VerlagBerlinHeidelberg2011
Description:The list of books you might like
