Approximation and Online Algorithms: Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers PDF
Preview Approximation and Online Algorithms: Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers
Lecture Notes in Computer Science 3351 CommencedPublicationin1973 FoundingandFormerSeriesEditors: GerhardGoos,JurisHartmanis,andJanvanLeeuwen EditorialBoard DavidHutchison LancasterUniversity,UK TakeoKanade CarnegieMellonUniversity,Pittsburgh,PA,USA JosefKittler UniversityofSurrey,Guildford,UK JonM.Kleinberg CornellUniversity,Ithaca,NY,USA FriedemannMattern ETHZurich,Switzerland JohnC.Mitchell StanfordUniversity,CA,USA MoniNaor WeizmannInstituteofScience,Rehovot,Israel OscarNierstrasz UniversityofBern,Switzerland C.PanduRangan IndianInstituteofTechnology,Madras,India BernhardSteffen UniversityofDortmund,Germany MadhuSudan MassachusettsInstituteofTechnology,MA,USA DemetriTerzopoulos NewYorkUniversity,NY,USA DougTygar UniversityofCalifornia,Berkeley,CA,USA MosheY.Vardi RiceUniversity,Houston,TX,USA GerhardWeikum Max-PlanckInstituteofComputerScience,Saarbruecken,Germany Giuseppe Persiano Roberto Solis-Oba (Eds.) Approximation and Online Algorithms Second International Workshop, WAOA 2004 Bergen, Norway, September 14-16, 2004 Revised Selected Papers 1 3 VolumeEditors GiuseppePersiano UniversitàdegliStudidiSalerno DipartimentodiInformaticaedApplicazioni ViaS.Allende,43,84081Baronissi(SA),Italy E-mail:[email protected] RobertoSolis-Oba TheUniversityofWesternOntario DepartmentofComputerScience London,Ontario,N6A5B7,Canada E-mail:[email protected] LibraryofCongressControlNumber:2005921102 CRSubjectClassification(1998):F.2.2,G.2.1-2,G.1.2,G.1.6,I.3.5,E.1 ISSN0302-9743 ISBN3-540-24574-XSpringerBerlinHeidelbergNewYork Thisworkissubjecttocopyright.Allrightsarereserved,whetherthewholeorpartofthematerialis concerned,specificallytherightsoftranslation,reprinting,re-useofillustrations,recitation,broadcasting, reproductiononmicrofilmsorinanyotherway,andstorageindatabanks.Duplicationofthispublication orpartsthereofispermittedonlyundertheprovisionsoftheGermanCopyrightLawofSeptember9,1965, initscurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Violationsareliable toprosecutionundertheGermanCopyrightLaw. SpringerisapartofSpringerScience+BusinessMedia springeronline.com ©Springer-VerlagBerlinHeidelberg2005 PrintedinGermany Typesetting:Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India Printedonacid-freepaper SPIN:11389811 06/3142 543210 Preface The 2nd Workshop on Approximation and Online Algorithms (WAOA 2004) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications arising from a variety of fields. WAOA 2004 took place in Bergen, Norway, from September14toSeptember16,2004.TheworkshopwaspartoftheALGO2004 event which also hosted ESA, WABI, IWPEC, and ATMOS. TopicsofinterestsforWAOA2004were:applicationstogametheory,approx- imation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, routing, packing and covering, paradigms, randomization techniques, and scheduling problems. In response to our call we received 47 submissions. Each submission was reviewed by at least 3 referees, who judged the paper on originality, quality, and consistency with the topics of the conference. Based on the reviews, the Program Committee selected 21 papers. This volume contains the 21 selected papers and the two invited talks given by Yossi Azar and Klaus Jansen. Wethankalltheauthorswhosubmittedpaperstotheworkshopandwealso kindly thank the local organizers of ALGO 2004. November 2004 G. Persiano R. Solis-Oba WAOA 2004 September 14–16 2004, Bergen, Norway Program Co-chairs Giuseppe Persiano Universita` di Salerno, Italy Roberto Solis-Oba University of Western Ontario, Canada Program Committee Yossi Azar Tel Aviv University, Israel Evripidis Bampis University of Evry, France Thomas Erlebach ETH, Zurich, Switzerland Klaus Jansen University of Kiel, Germany Christos Kaklamanis University of Patras, Greece Marek Karpinski Rheinische Friedrich-Wilhelms Universita¨t, Germany Claire Kenyon Ecole Polytechnique, France Samir Kuller University of Maryland, USA David Peleg Weizmann Institute of Science, Israel Giuseppe Persiano Universita` di Salerno, Italy Martin Skutella Max-Planck-Institut fu¨r Informatik, Germany Roberto Solis-Oba University of Western Ontario, Canada Sponsoring Institutions Dipartimento di Informatica ed Applicazioni “R.M. Capocelli”, Universita` di Salerno, Italy Referees Ernst Althaus Han Hoogeveen Micha Sharir Vincenzo Auletta Alex Kesselman Maxim Sviridenko Holger Bast Yoo Ah Kim Kavitha Telikepalli Chandra Chekuri Stavros Kolliopoulos Ralf Th¨ole Amir Epstein Martin Loehnertz Justin Wan Leah Epstein Maren Martens Deshi Ye Sandor Fekete Paolo Penna Hu Zhang Amos Fiat Kirk Pruhs Alexei Fishkin Dr. Raghavachari Olga Gerber Yossi Richter Table of Contents Invited Talks Online Packet Switching Yossi Azar .................................................... 1 Approximation Algorithms for Mixed Fractional Packing and Covering Problems Klaus Jansen.................................................. 6 Regular Papers Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-Trees D´aniel Marx .................................................. 9 Online Bin Packing with Resource Augmentation Leah Epstein, Rob van Stee ..................................... 23 A PTAS for Delay Minimization in Establishing Wireless Conference Calls Leah Epstein, Asaf Levin ....................................... 36 This Side Up! Leah Epstein, Rob van Stee ..................................... 48 Approximation Algorithm for Directed Multicuts Yana Kortsarts, Guy Kortsarz, and Zeev Nutov.................... 61 Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria Rajiv Gandhi, Magnu´s M. Halldo´rsson, Guy Kortsarz, Hadas Shachnai ............................................... 68 Approximation Algorithms for Spreading Points Sergio Cabello ................................................. 83 More Powerful and Simpler Cost-Sharing Methods Paolo Penna, Carmine Ventre ................................... 97 VIII Table of Contents Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints Hadas Shachnai, Oded Shmueli, Robert Sayegh..................... 111 Priority Algorithms for Graph Optimization Problems Allan Borodin, Joan Boyar, Kim S. Larsen ....................... 126 Pricing Network Edges to Cross a River Alexander Grigoriev, Stan van Hoesel, Anton F. van der Kraaij, Marc Uetz, Mustapha Bouhtou .................................. 140 Submodular Integer Cover and Its Application to Production Planning Toshiro Fujito, Takatoshi Yabuta................................. 154 Stochastic Online Scheduling on Parallel Machines Nicole Megow, Marc Uetz, Tjark Vredeveld ........................ 167 A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path Davide Bilo`, Guido Proietti ..................................... 181 Ordering-Preserving Transformations and Greedy-Like Algorithms Spyros Angelopoulos............................................ 197 Off-line Admission Control for Advance Reservations in Star Networks Udo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl .................................. 211 Joint Base Station Scheduling Thomas Erlebach, Riko Jacob, Matu´ˇs Mihaˇl´ak, Mark Nunkesser, G´abor Szab´o, Peter Widmayer................................... 225 Universal Bufferless Routing Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas .......... 239 Strong Colorings of Hypergraphs Geir Agnarsson, Magnu´s M. Halldo´rsson ......................... 253 Deterministic Monotone Algorithms for Scheduling on Related Machines Pasquale Ambrosio, Vincenzo Auletta............................. 267 Better Bounds for Minimizing SONET ADMs Leah Epstein, Asaf Levin ....................................... 281 Author Index................................................... 295 Online Packet Switching Yossi Azar1,(cid:1) School of Computer Science, Tel Aviv University, Tel Aviv, 69978, Israel [email protected] Abstract. We discuss packet switching for single-queue, multi-queue buffers and CIOQ buffers. We evaluate the algorithms by competitive analysis. We also mention the zero-one principle that applies to general switching networks. 1 Introduction Overview: Packet routing networks, most notably the Internet, have become the preferred platform for carrying data of all kinds. Due to the steady increase of network traffic, and the fact that Internet traffic volume tends to constantly fluctuate,QualityofService(QoS)networks,whichallowprioritizationbetween differenttrafficstreamshavegainedconsiderableattentionwithinthenetworking community. As network overloads become frequent, intermediate switches have tocopewithincreasingamountsoftraffic,whileattemptingtopassforwardmore “valuable”packets,wherevaluescorrespondtotherequiredqualityofservicefor eachpacket.Wecanmeasurethequalityofthedecisionsmadewithinanetwork byconsideringthetotalvalueofpacketsthatweredeliveredtotheirdestination. Traditionally,theperformanceofqueuingsystemshasbeenstudiedwithinthe stabilityanalysisframework,eitherbyaprobabilisticmodelforpacketinjection (queuing theory, see e.g. [11,18]) or an adversarial model (adversarial queuing theory, see e.g. [5,12]). In stability analysis packets are assumed to be identical, and the goal is to determine queue sizes such that no packet is ever dropped. However, real-world networks do not usually conform with the above assump- tions, and it seems inevitable to drop packets in order to maintain efficiency. As a result, the competitive analysis framework, which avoids any assumptions on theinputsequenceandcomparestheperformanceofonlinealgorithmstotheop- timalsolution,hasbeenadoptedrecentlyforstudyingthroughputmaximization problems. Single-Queue:Ingeneralweassumethatallpacketshaveafixedsizeandeach is associated with a value. We are given a FIFO queue with bounded capacity. At each time step new packets arrive to the end of the queue, and the packet at the head of the queue is transmitted. The goal is to maximize the total value of (cid:1) Research supported in part by the Israel Science Foundation. G.PersianoandR.Solis-Oba(Eds.):WAOA2004,LNCS3351,pp.1–5,2005. (cid:1)c Springer-VerlagBerlinHeidelberg2005
Description:The list of books you might like
