Approximation and Online Algorithms: 10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers

308 Pages·2013·3.31 MB·English

by  Nikhil Bansal (auth.)

Thomas Erlebach
Giuseppe Persiano (Eds.)
6
4 Approximation
8
7

S
C and Online Algorithms
N
L
10th International Workshop, WAOA 2012
Ljubljana, Slovenia, September 2012
Revised Selected Papers
123
Lecture Notes in Computer Science 7846
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
Thomas Erlebach Giuseppe Persiano (Eds.)
Approximation
and Online Algorithms
10th International Workshop, WAOA 2012
Ljubljana, Slovenia, September 13-14, 2012
Revised Selected Papers
1 3
VolumeEditors
ThomasErlebach
UniversityofLeicester
DepartmentofComputerScience
UniversityRoad
LeicesterLE17RH,UK
E-mail:[email protected]
GiuseppePersiano
UniversitàdiSalerno
DipartimentodiInformatica"RenatoM.Capocelli"
ViaPonteDonMelillo
84081Fisciano(SA),Italy
E-mail:[email protected]
ISSN0302-9743 e-ISSN1611-3349
ISBN978-3-642-38015-0 e-ISBN978-3-642-38016-7
DOI10.1007/978-3-642-38016-7
SpringerHeidelbergDordrechtLondonNewYork
LibraryofCongressControlNumber:2013936596
CRSubjectClassification(1998):F.2.2,G.2.1-2,G.1.2,G.1.6,I.3.5,E.1
LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues
©Springer-VerlagBerlinHeidelberg2013
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)
Preface
The 10th Workshop on Approximation and Online Algorithms (WAOA 2012)
focusedonthe designandanalysisofalgorithmsfor online andcomputationally
hard problems. Both kinds of problems have a large number of applications
from a variety of fields. WAOA 2012 took place in Ljubljana, Slovenia, during
September 13–14, 2012. The workshop was part of the ALGO 2012 event that
also hosted ESA, WABI, ALGOSENSORS, IPEC, ATMOS, and MASSIVE.
TopicsofinterestforWAOA2012were:algorithmicgametheory,algorithmic
trading,coloringandpartitioning,competitiveanalysis,computationaladvertis-
ing, computational finance, cuts and connectivity, geometric problems, graph
algorithms, inapproximability results, mechanism design, natural algorithms,
network design, packing and covering, paradigms for the design and analysis
of approximation and online algorithms, parameterized complexity, real-world
applications, and scheduling problems. In response to the call for papers we
received 60 submissions, one of which was subsequently withdrawn. Each sub-
mission was reviewed by at least three referees. The submissions were mainly
judged on originality, technical quality, and relevance to the topics of the con-
ference.Basedonthe reviews,the ProgramCommittee selected22papers.This
volume contains final revised versions of these papers as well as an abstract of
the invited talk.
We would like to thank all the authors who submitted papers to WAOA
2012,andourplenaryinvitedspeakerNikhilBansalforacceptingourinvitation.
Furthermore, we are grateful to the local organizers of ALGO 2012: Andrej
Brodnik(Co-chair),UroˇsCˇibej,GaˇsperFele-Zˇorˇz,MatevˇzJekovec,JurijMiheliˇc,
Borut Robiˇc (Co-chair), and Andrej Toliˇc.
March 2013 Thomas Erlebach
Giuseppe Persiano
Organization
Program Co-chairs
Thomas Erlebach University of Leicester, UK
Giuseppe Persiano Universit`a di Salerno, Italy
Program Committee
Evripidis Bampis Universit´e Pierre et Marie Curie, Paris, France
Cristina Bazgan Universit´e Paris Dauphine, France
Wolfgang Bein University of Nevada, Las Vegas, USA
Marek Chrobak University of California, Riverside, USA
Andrea Clementi University of Rome “Tor Vergata”, Italy
Thomas Erlebach University of Leicester, UK
Stanley Fung University of Leicester, UK
Martin Hoefer RWTH Aachen, Germany
Klaus Jansen University of Kiel, Germany
Christos Kaklamanis University of Patras and CTI, Greece
Nicole Megow MaxPlanckInstituteforInformatics,Saarbru¨cken,
Germany
Seffi Naor Technion, Haifa, Israel
Zeev Nutov The Open University of Israel
Giuseppe Persiano Universit`a di Salerno, Italy
Kirk Pruhs University of Pittsburgh, USA
Jiˇr´ıSgall Charles University, Prague, Czech Republic
Roberto Solis-Oba University of Western Ontario, Canada
Rob van Stee MaxPlanckInstituteforInformatics,Saarbru¨cken,
Germany
Andreas Wiese Sapienza University of Rome, Italy
Paul Wollan Sapienza University of Rome, Italy
Additional Referees
James Andro-Vasko Lucas Bang Henning Bruhn
Spyros Angelopoulos Marcin Bienkowski Vincent Chau
Antonios Antoniadis Vittorio Bilo` Shiri Chechik
Vincenzo Auletta Marin Bougeret Chandra Chekuri
Ja´nos Balogh Joan Boyar Lin Chen
Evangelos Bampas Peter Brucker Shahar Chen
VIII Organization
Christine Chung Hiro Ito Marcel Ochel
Nachshon Cohen Takehiro Ito Vinayaka Pandit
Daniel Cole Gwena¨el Joret Ondrej Pangrac
Basile Cou¨etoux Lior Kamma Vangelis Paschos
Pierluigi Crescenzi Frank Kammer Francesco Pasquale
Ovidiu Daescu Panagiotis Kanellopoulos Lars Pra¨del
Miriam Di Ianni Nikos Karanikolas Dror Rawitz
Yann Disser Thomas Kesselheim Damien Regnault
Reza Dorrigiv Kim Manuel Klein Daniel Reichman
Gyo¨rgy Do´sa Guy Kortsarz Marc Renault
Zdenek Dvorak Stefan Kraft Christina Robenek
Matthias Englert Felix Kumm Gianluca Rossi
Leah Epstein Maria Kyropoulou Matthias Stallmann
Lene Favrholdt Kati Land Zoya Svitkina
Moran Feldman Lawrence Larmore Eric Torng
Diodato Ferraioli Kim S. Larsen Gerhard Trippen
Esteban Feuerstein Erik Jan van Leeuwen Jos´e Verschae
Rudolf Fleischer Dimitrios Letsios Fabio Vitale
Dimitris Fotakis Asaf Levin Tjark Vredeveld
Pierre Fraigniaud Fei Li Jens Vygen
Takuro Fukunaga Alejandro Lo´pez-Ortiz Yicheng Wen
Martin Gairing Giorgio Lucarelli Matthias Westermann
Heidi Gebauer Manor Mendel Li Yan
Yiannis Giannakopoulos Ioannis Milis Jonathan Yaniv
Fabrizio Grandoni Debajyoti Mondal Guochuan Zhang
Alexander Grigoriev Benjamin Moseley Georgios Zois
Xin Han Kim Thang Nguyen
Tony Huynh Serguei Norine
Table of Contents
Invited Contribution
The Primal-Dual Approach for Online Algorithms.................... 1
Nikhil Bansal
Session 1: Graphs and Networks
Independent Set with Advice: The Impact of Graph Knowledge........ 2
Stefan Dobrev, Rastislav Kra´loviˇc, and Richard Kra´loviˇc
Online Multi-Commodity Flow with High Demands .................. 16
Guy Even and Moti Medina
Approximating Spanning Trees with Few Branches ................... 30
Markus Chimani and Joachim Spoerhase
On the Complexity of the Regenerator Location Problem - Treewidth
and Other Parameters ............................................ 42
Itamar Hartstein, Mordechai Shalom, and Shmuel Zaks
Session 2: Geometric Problems
Online Exploration of Polygons with Holes .......................... 56
Robert Georges, Frank Hoffmann, and Klaus Kriegel
Probabilistic k-Median Clustering in Data Streams................... 70
Christiane Lammersen, Melanie Schmidt, and Christian Sohler
Linear Time Approximation for Dominating Sets and Independent
Dominating Sets in Unit Disk Graphs .............................. 82
Guilherme D. da Fonseca, Celina M.H. de Figueiredo,
Vin´ıcius G.P. de Sa´, and Raphael Machado
On Minimum-and Maximum-Weight Minimum Spanning Trees with
Neighborhoods .................................................. 93
Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali,
Akitoshi Kawamura, Alejandro Lo´pez-Ortiz, and Diego Seco
Session 3: Online Algorithms
Asymptotically Optimal Online Page Migration on Three Points ....... 107
Akira Matsubayashi
X Table of Contents
R–LINE: A Better Randomized 2-Server Algorithm on the Line........ 120
Lucas Bang, Wolfgang Bein, and Lawrence L. Larmore
Black and White Bin Packing ..................................... 131
J´anos Balogh, Jo´zsef B´ek´esi, Gyorgy Dosa, Hans Kellerer, and
Zsolt Tuza
Minimizing Cache Usage in Paging................................. 145
Alejandro L´opez-Ortiz and Alejandro Salinger
Session 4: Scheduling
Competitive-Ratio Approximation Schemes for Makespan Scheduling
Problems ....................................................... 159
Adam Kurpisz, Monaldo Mastrolilli, and Georgios Stamoulis
Online Primal-Dual for Non-linear Optimization with Applications to
Speed Scaling ................................................... 173
Anupam Gupta, Ravishankar Krishnaswamy, and Kirk Pruhs
Approximating the Throughput by Coolest First Scheduling........... 187
Christoph Du¨rr, Ioannis Milis, Julien Robert, and Georgios Zois
Algorithms for Cost-Aware Scheduling.............................. 201
Janardhan Kulkarni and Kamesh Munagala
Session 5: Algorithmic Game Theory
AUnifying ToolforBounding the QualityofNon-cooperativeSolutions
in Weighted Congestion Games .................................... 215
Vittorio Bilo`
Some Anomalies of Farsighted Strategic Behavior .................... 229
Vittorio Bilo`, Michele Flammini, Gianpiero Monaco, and
Luca Moscardelli
Session 6: Approximation Algorithms
Scheduling with an OrthogonalResource Constraint.................. 242
Martin Niemeier and Andreas Wiese
Improved Approximation Guarantees for Lower-Bounded Facility
Location........................................................ 257
Sara Ahmadian and Chaitanya Swamy
A 4-Approximation for the Height of Drawing 2-Connected
Outer-Planar Graphs............................................. 272
Therese Biedl
Table of Contents XI
Approximation Algorithms for the Wafer to Wafer Integration
Problem ........................................................ 286
Trivikram Dokka, Marin Bougeret, Vincent Boudet,
Rodolphe Giroudeau, and Frits C.R. Spieksma
Author Index.................................................. 299