Computing and Combinatorics: 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings PDF
Preview Computing and Combinatorics: 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings
Lecture Notes in Computer Science 7434 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 Joachim Gudmundsson Julián Mestre Taso Viglas (Eds.) Computing and Combinatorics 18th Annual International Conference COCOON 2012 Sydney, Australia, August 20-22, 2012 Proceedings 1 3 VolumeEditors JoachimGudmundsson JuliánMestre TasoViglas UniversityofSydney SchoolofIT,BuildingJ12 Sydney,NSW2006,Australia E-mail:[email protected] E-mail:[email protected] E-mail:[email protected] ISSN0302-9743 e-ISSN1611-3349 ISBN978-3-642-32240-2 e-ISBN978-3-642-32241-9 DOI10.1007/978-3-642-32241-9 SpringerHeidelbergDordrechtLondonNewYork LibraryofCongressControlNumber:2012942913 CRSubjectClassification(1998):F.2,C.2,G.2,F.1,E.1,I.3.5 LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues ©Springer-VerlagBerlinHeidelberg2012 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 papers in this volume were selected for publication in the 18th Annual International Computing and Combinatorics Conference, held during August 20–22, 2012, in Sydney, Australia. The Annual International Computing and CombinatoricsConferenceisaforumforresearchersworkingintheareasrelated to theoretical aspects of computing. Typicaltopicscoveredbythisconferenceinclude(butarenotrestrictedto):al- gorithms,datastructures,algorithmicgametheory,onlinealgorithms,automatas, languages,logic,computability,complexitytheory,computationallearningtheory, knowledgediscovery,cryptography,parallelanddistributed computing, reliabil- ityandsecurity,databasetheory,computationalbiology,computationalalgebra, computationalgeometry,graphdrawing,informationvisualization,graphtheory, communicationnetworksandoptimization. Thisyeartheconferencereceived121submissions.Eachpaperreceivedamin- imumofthreeindependentexpertreviewsbytheProgramCommitteemembers orreviewers.ThereviewswerethoroughlydiscussedbytheProgramCommittee, and 50 papers were selected for presentation during the conference. In addition to these presentations, the program also included three invited presentations by Kamal Jain, Joseph Mitchell, and Ja´nos Pach. Wewouldliketoexpressourgratitudefortheauthorsofallpaperssubmitted toCOCOON2012,theProgramCommitteemembersandthereviewers,fortheir contribution to making this conference possible. Finally, we would like to acknowledge and thank the sponsors of this event, Google and National ICT Australia, for their generous support for COCOON 2012. June 2012 Joachim Gudmundsson Julia´n Mestre Taso Viglas Organization Program Committee Eric Allender Rutgers University, USA Giorgos Christodoulou University of Liverpool, UK Giovanni Di Crescenzo Telcordia, USA David Eppstein University of California, Irvine, USA Rudolf Fleischer GUtech, Oman Mordecai Golin Hong Kong UST, Hong Kong, SAR China Joachim Gudmundsson University of Sydney, Australia Anupam Gupta Carnegie Mellon University, USA Thore Husfeldt IT University of Copenhagen and Lund University, Denmark and Sweden Kazuo Iwama Kyoto University, Japan Julia´n Mestre University of Sydney, Australia Peter Bro Miltersen Aarhus University, Denmark Pat Morin Carleton University, Canada Gonzalo Navarro University of Chile, Chile Kunihiko Sadakane National Institute of Informatics, Tokyo, Japan Saket Saurabh The Institute of Mathematical Sciences, Chennai, India Christian Sohler TU Dortmund, Germany Xiaoming Sun Tsinghua University, China Kavitha Telikepalli Indian Institute of Science, India Anke Van Zuylen Max Planck Institute for Informatics, Germany Anastasios Viglas University of Sydney, Australia Dorothea Wagner University of Karlsruhe, Germany Gerhard Woeginger TU Eindhoven, The Netherlands Prudence Wong University of Liverpool, UK Additional Reviewers Aggarwal,Divesh Bose, Prosenjit Asahiro, Yuichi Bu, Dongbo Badanidiyuru, Ashwinkumar Burcea, Mihai Barbay, J´er´emy Campos, S´ergio Baum, Moritz Canzar, Stefan Bl¨asius, Thomas Cheng, Yongxi Bogdanov,Andrej Chiu, Man Kwun Bollig, Beate Chrobak, Marek Bonsma, Paul Cicalese, Ferdinando VIII Organization Collins, Andrew Li, Rongbin Cormode, Graham Liedloff, Mathieu Crowston, Robert Lin, Chuang-Chieh Data, Deepesh M.S., Ramanujan Dibbelt, Julian Ma, Bin Dujmovic, Vida Madry, Aleksander Dutta, Kunal Maheshwari, Anil Ehsanfar, Ebrahim Markakis, Evangelos Ferreira, Rui Martin, Russell Fortunato, Santo Mchedlidze, Tamara Fotakis, Dimitris Mertzios, George Frati, Fabrizio Mikalaˇcki, Mirjana Gao, Xi Alice Misra, Pranabendu Gaspers, Serge Miyata, Hiroyuki Gemsa, Andreas Mnich, Matthias Giannakopoulos,Yiannis Munteanu, Alexander Gille, Marc Mustafa, Nabil Gorry, Thomas Muthu, Rahul Halldorsson, Magnus M. Narayanan,Narayanan Hellweg, Frank Nasre, Meghana Hernandez, Cecilia Nekrich, Yakov Jager, Tibor Niedermeier, Rolf Jansson, Jesper Nikiforov, Vladimir Jin, Jiongxin Noellenburg, Martin Jones, Mark O’Donnell, Ryan Jordan, Tibor Ojiaku, Jude-Thaddeus Kane, Daniel M. Oren, Sigal Kawarabayashi,Ken-Ichi Otachi, Yota Keszegh, Bal´azs Pajor, Thomas Kida, Takuya Papadopoulos,Charis Kiyomi, Masashi Papakonstantinou,Periklis Klauck, Hartmut Pavan, Aduri Kloks, Ton Piliouras, Georgios Kolay, Sudeshna Popa, Alexandru Kovacs, Annamaria P´erez-Lantero,Pablo Kratsch, Stefan Rajagopalan, S. Raj Krivosija,Amer Raman, Venkatesh Krug, Marcus Randall, Dana Kupferman, Orna Russo, Luis M.S. Lam, Chi Kit Rutter, Ignaz Lambert, Nicolas S. Sabharwal, Yogish Lammersen, Christiane Sach, Benjamin Lan, Yu Saeidinvar, Reza Leung, Henry C.M. Saitoh, Toshiki Levin, Asaf Schalekamp, Frans Organization IX Schmidt, Melanie van Stee, Rob Schumm, Andrea Varma, Nithin Mahendra Schwiegelshohn, Chris Ventre, Carmine Shalom, Mordechai Vollmer, Heribert Shi, Yaoyun Voloshin, Ariella Skopalik, Alexander Wahlstro¨m, Magnus Smid, Michiel Wan, Andrew Sprugnoli, Renzo Wang, Yajun Stamoulis, Georgios Wiese, Andreas Stewart, Iain Wolfler-Calvo, Roberto Suchy, Ondrej Wuhrer, Stefanie Suzuki, Yasuhiro Wulff-Nilsen, Christian Tamaki, Suguru Xia, Lirong Tang, Bo Xiao, Mingyu Tantau, Till Yamazaki, Koichi Tazari, Siamak Yon, Juyoung Telelis, Orestis Yu, Wei Trapnell, Cole Zhang, Shengyu van Leeuwen, Erik Jan Table of Contents A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree ....................................................... 1 Binay Bhattacharya and Tsunehiko Kameda A Simple D2-Sampling Based PTAS for k-Means and other Clustering Problems ....................................................... 13 Ragesh Jaiswal, Amit Kumar, and Sandeep Sen Speed Scaling for Maximum Lateness............................... 25 Evripidis Bampis, Dimitrios Letsios, Ioannis Milis, and Georgios Zois Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others? ............................................. 37 Peter Floderus, Mirosl(cid:2)aw Kowaluk, Andrzej Lingas, and Eva-Marta Lundell Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs................................................... 49 Ivona Beza´kov´a and Zachary Langley Online Knapsack Problem with Removal Cost ....................... 61 Xin Han, Yasushi Kawase, and Kazuhisa Makino An Improved Exact Algorithm for TSP in Degree-4 Graphs ........... 74 Mingyu Xiao and Hiroshi Nagamochi Dynamic Programming for H-minor-free Graphs (Extended Abstract) ............................................. 86 Juanjo Ru´e, Ignasi Sau, and Dimitrios M. Thilikos Restricted Max-Min Fair Allocations with Inclusion-Free Intervals...... 98 Monaldo Mastrolilli and Georgios Stamoulis An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks ....................................................... 109 Maxim A. Babenko, Kamil Salikhov, and Stepan Artamonov Towards Optimal and Expressive Kernelization for d-Hitting Set....... 121 Ren´e van Bevern XII Table of Contents MaximumNumberofMinimalFeedbackVertexSetsinChordalGraphs and Cographs ................................................... 133 Jean-Franc¸ois Couturier, Pinar Heggernes, Pim van ’t Hof, and Yngve Villanger A Local Algorithm for Finding Dense Bipartite-Like Subgraphs........ 145 Pan Peng Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs ........ 157 Ton Kloks, Sheung-Hung Poon, Chin-Ting Ung, and Yue-Li Wang On the Minimum Degree Hypergraph Problem with Subset Size Two and the Red-Blue Set Cover Problem with the Consecutive Ones Property........................................................ 169 Biing-Feng Wang and Chih-Hsuan Li Rainbow Colouring of Split and Threshold Graphs ................... 181 L. Sunil Chandran and Deepak Rajendraprasad Approximating the Rainbow – Better Lower and Upper Bounds........ 193 Alexandru Popa Ramsey Numbers for Line Graphs and Perfect Graphs................ 204 R´emy Belmonte, Pinar Heggernes, Pim van ’t Hof, and Reza Saei Geodesic Order Types ............................................ 216 Oswin Aichholzer, Matias Korman, Alexander Pilz, and Birgit Vogtenhuber Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number ........................................................ 228 Stephane Durocher and Saeed Mehrabi Monotone Paths in Planar Convex Subdivisions...................... 240 Adrian Dumitrescu, Gu¨nter Rote, and Csaba D. To´th The Cost of Bounded Curvature ................................... 252 Hyo-Sil Kim and Otfried Cheong Optimally Solving a Transportation Problem Using Voronoi Diagrams ....................................................... 264 Darius Geiß, Rolf Klein, and Rainer Penninger Unexplored Steiner Ratios in Geometric Networks.................... 275 Paz Carmi and Lilach Chaitman-Yerushalmi Geometric RAC Simultaneous Drawings of Graphs ................... 287 Evmorfia Argyriou, Michael Bekos, Michael Kaufmann, and Antonios Symvonis Table of Contents XIII Simultaneous Embeddings with Vertices Mapping to Pre-specified Points .......................................................... 299 Taylor Gordon Multilevel Drawings of Clustered Graphs............................ 311 Fabrizio Frati Outerplanar Graph Drawings with Few Slopes ....................... 323 Kolja Knauer, Piotr Micek, and Bartosz Walczak Fa´ry’s Theorem for 1-Planar Graphs ............................... 335 Seok-Hee Hong, Peter Eades, Giuseppe Liotta, and Sheung-Hung Poon Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application ..................................................... 347 Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, and Hiroki Arimura External Memory Soft Heap, and Hard Heap, a Meldable Priority Queue .......................................................... 360 Alka Bhushan and Sajith Gopalan Partially Specified Nearest Neighbor Search ......................... 372 Tomas Hruz and Marcel Scho¨ngens Multi-pattern Matching with Bidirectional Indexes ................... 384 Simon Gog, Kalle Karhu, Juha Ka¨rkka¨inen, Veli Ma¨kinen, and Niko V¨alima¨ki Succinct Representations of Binary Trees for Range Minimum Queries ......................................................... 396 Pooya Davoodi, Rajeev Raman, and Srinivasa Rao Satti Lower Bounds against Weakly Uniform Circuits...................... 408 Ruiwen Chen and Valentine Kabanets On TC0 Lower Bounds for the Permanent........................... 420 Jeff Kinne Formula Complexity of Ternary Majorities .......................... 433 Kenya Ueno On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles ..................................................... 445 Fahad Panolan and Ashutosh Rai The Complexity of Unary Subset Sum .............................. 458 Nutan Limaye, Meena Mahajan, and Karteek Sreenivasaiah
The list of books you might like
