Combinatorial Optimization and Applications: 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings PDF
Preview Combinatorial Optimization and Applications: 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings
Zaixin Lu · Donghyun Kim · Weili Wu Wei Li · Ding-Zhu Du (Eds.) Combinatorial 6 Optimization 8 4 9 S and Applications C N L 9th International Conference, COCOA 2015 Houston, TX, USA, December 18–20, 2015 Proceedings 123 Lecture Notes in Computer Science 9486 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, Lancaster, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Zürich, Switzerland John C. Mitchell Stanford University, Stanford, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Dortmund, Germany Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbrücken, Germany More information about this series at http://www.springer.com/series/7407 Zaixin Lu Donghyun Kim Weili Wu (cid:129) (cid:129) (cid:129) Wei Li Ding-Zhu Du (Eds.) (cid:129) Combinatorial Optimization and Applications 9th International Conference, COCOA 2015 – Houston, TX, USA, December 18 20, 2015 Proceedings 123 Editors ZaixinLu Wei Li Marywood University Texas SouthernUniversity Scranton, PA Houston, TX USA USA DonghyunKim Ding-Zhu Du NorthCarolina Central University University of Texas atDallas Durham, NC Richardson, TX USA USA Weili Wu University of Texas atDallas Richardson, TX USA ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notesin Computer Science ISBN 978-3-319-26625-1 ISBN978-3-319-26626-8 (eBook) DOI 10.1007/978-3-319-26626-8 LibraryofCongressControlNumber:2015954595 LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues SpringerChamHeidelbergNewYorkDordrechtLondon ©SpringerInternationalPublishingSwitzerland2015 Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartofthe material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodologynow knownorhereafterdeveloped. Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant protectivelawsandregulationsandthereforefreeforgeneraluse. Thepublisher,theauthorsandtheeditorsaresafetoassumethattheadviceandinformationinthisbookare believedtobetrueandaccurateatthedateofpublication.Neitherthepublishernortheauthorsortheeditors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissionsthatmayhavebeenmade. Printedonacid-freepaper SpringerInternationalPublishingAGSwitzerlandispartofSpringerScience+BusinessMedia (www.springer.com) Preface The 9th Annual International Conference on Combinatorial Optimization and Appli- cations (COCOA 2015) was held during December 18–20, 2015, in Houston, Texas, USA.COCOA2015providedaforumforresearchersworkingintheareaoftheoretical computer science and combinatorics. Thetechnicalprogramoftheconferenceincluded59contributedpapersselectedby theProgram Committee from 125full submissions received inresponsetothecall for papers.AllthepaperswerepeerreviewedbyProgramCommitteemembersorexternal reviewers. The topics cover most aspects of theoretical computer science and combinatorics related to computing, including classic combinatorial optimization, geometric opti- mization, network optimization, optimization in graphs, applied optimization, com- plexity and game, and miscellaneous. Some of the papers will be selected for publicationinspecialissuesofAlgorithmica,TheoreticalComputerScience,Journalof Combinatorial Optimization, and Computational Social Networks. It is expected that the journal version of the papers will appear in a more complete form. Wethankallthepeoplewhomadethismeetingpossible:theauthorsforsubmitting papers,theProgramCommitteemembers,andexternalreviewersforvolunteeringtheir time to review conference papers. We would also like to extend special thanks to the publication, publicity, and local organizationchairsfor theirworkin making COCOA 2015 a successful event. September 2015 Zaixin Lu Donghyun Kim Weili Wu Wei Li Ding-Zhu Du Organization Program Chairs Zaixin Lu Marywood University, USA Donghyun Kim North Carolina Central University, USA Ding-Zhu Du University of Texas at Dallas, USA Program Committee Wolfgang Bein University of Nevada, Las Vegas, USA Gruia Calinescu Illinois Institute of Technology, USA Zhi-Zhong Chen Tokyo Denki University, Japan Xujin Chen Chinese Academy of Sciences, China Yongxi Cheng Xi’an Jiaotong University, China Ovidiu Daescu University of Texas at Dallas, USA Bhaskar DasGupta University of Illinois at Chicago, USA Vladimir Deineko Warwick University, UK Thang Dinh Virginia Commonwealth University, USA Ding-Zhu Du University of Texas at Dallas, USA Zhenhua Duan Xidian University, China Neng Fan University of Arizona, USA Bin Fu University of Texas-Pan American, USA Xiaofeng Gao Shanghai Jiao Tong University, USA Majed Haddad University of Avignon, France Juraj Hromkovic ETH Zurich, Switzerland Sun-Yuan Hsieh National Cheng Kung University, Taiwan Tsan-sheng Hsu Academia Sinica, Taiwan Hejiao Huang Harbin Institute of Technology, China Kazuo Iwama Kyoto University, Japan Donghyun Kim North Carolina Central University, USA Jie Li University of Tsukuba, Japan Minming Li City University of Hong Kong, SAR China Zaixin Lu Marywood University, USA Mitsunori Ogihara University of Miami, USA Xian Qiu Zhejiang University, China Suneeta Ramaswami Rutgers University, USA Rahul Vaze The Tata Institute of Fundamental Research, India Lusheng Wang City University of Hong Kong, SAR China Boting Yang University of Regina, Canada Hsu-Chun Yen National Taiwan University, Taiwan VIII Organization Zhao Zhang Zhejiang Normal University, China Jiaofei Zhong California State University, USA Yuqing Zhu California State University, USA Ilias Kotsireas Wilfrid Laurier University, Canada Contents Classic Combinatorial Optimization Improved Algorithms for the Evacuation Route Planning Problem. . . . . . . . . 3 Gopinath Mishra, Subhra Mazumdar, and Arindam Pal Improved MAXSAT Algorithms for Instances of Degree 3 . . . . . . . . . . . . . . 20 Chao Xu, Jianer Chen, and Jianxin Wang Directed Pathwidth and Palletizers. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 Frank Gurski, Jochen Rethmann, and Egon Wanke Black and White Bin Packing Revisited. . . . . . . . . . . . . . . . . . . . . . . . . . . 45 Jing Chen, Xin Han, Wolfgang Bein, and Hing-Fung Ting Local Search Algorithms for k-Median and k-Facility Location Problems with Linear Penalties. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60 Yishui Wang, Dachuan Xu, Donglei Du, and Chenchen Wu A ð5:83þ(cid:2)Þ-Approximation Algorithm for Universal Facility Location Problem with Linear Penalties . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72 Yicheng Xu, Dachuan Xu, Donglei Du, and Chenchen Wu Variants of Multi-resource Scheduling Problems with Equal Processing Times . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 82 Hamed Fahimi and Claude-Guy Quimper Geometric Optimization The Discrete and Mixed Minimax 2-Center Problem. . . . . . . . . . . . . . . . . . 101 Yi Xu, Jigen Peng, Yinfeng Xu, and Binhai Zhu Approximation Algorithms for Generalized MST and TSP in Grid Clusters . . . 110 Binay Bhattacharya, Ante Ćustić, Akbar Rafiey, Arash Rafiey, and Vladyslav Sokol Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Line . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 126 Apurva Mudgal and Supantha Pandit Optimal Self-assembly of Finite Shapes at Temperature 1 in 3D. . . . . . . . . . 138 David Furcy and Scott M. Summers X Contents Line Segment Covering of Cells in Arrangements. . . . . . . . . . . . . . . . . . . . 152 Matias Korman, Sheung-Hung Poon, and Marcel Roeloffzen An Improved On-line Strategy for Exploring Unknown Polygons . . . . . . . . . 163 Xuehou Tan and Qi Wei Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . 178 Michael Khachay and Helen Zaytseva Network Optimization A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 193 GennaroCordasco,LuisaGargano,MarcoMecchia,AdeleA.Rescigno, and Ugo Vaccaro An Efficient Shortest-Path Routing Algorithm in the Data Centre Network DPillar . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 209 Alejandro Erickson, Abbas Eslami Kiasari, Javier Navaridas, and Iain A. Stewart A Sensor Deployment Strategy in Bus-Based Hybrid Ad-Hoc Networks . . . . 221 Hongwei Du, Rongrong Zhu, Xiaohua Jia, and Chuang Liu New Insight into 2-Community Structures in Graphs with Applications in Social Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 236 Cristina Bazgan, Janka Chlebíková, and Thomas Pontoizeau WDCS: A Weight-Based Distributed Coordinate System . . . . . . . . . . . . . . . 251 Yaning Liu, Hongwei Du, and Qiang Ye Adaptive Scheduling Over a Wireless Channel Under Constrained Jamming. . . 261 Antonio Fernández Anta, Chryssis Georgiou, and Elli Zavou Metric and Distributed On-Line Algorithm for Minimizing Routing Interference in Wireless Sensor Networks. . . . . . . . . . . . . . . . . . . . . . . . . . 279 Kejia Zhang, Qilong Han, Zhipeng Cai, Guisheng Yin, and Junyu Lin Distributed Algorithm for Mending Barrier Gaps via Sensor Rotation in Wireless Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 293 Yueshi Wu and Mihaela Cardei Applied Optimization A Hybrid Large Neighborhood Search for Dynamic Vehicle Routing Problem with Time Deadline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 307 Dan Yang, Xiaohan He, Liang Song, Hejiao Huang, and Hongwei Du
The list of books you might like
