Frontiers in Algorithmics: 13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings PDF
Preview Frontiers in Algorithmics: 13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings
Yijia Chen Xiaotie Deng Mei Lu (Eds.) 8 5 Frontiers 4 1 1 S in Algorithmics C N L 13th International Workshop, FAW 2019 Sanya, China, April 29 – May 3, 2019 Proceedings 123 Lecture Notes in Computer Science 11458 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board Members 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, Zurich, 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, Chennai, 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 More information about this series at http://www.springer.com/series/7407 Yijia Chen Xiaotie Deng (cid:129) (cid:129) Mei Lu (Eds.) Frontiers in Algorithmics 13th International Workshop, FAW 2019 – Sanya, China, April 29 May 3, 2019 Proceedings 123 Editors Yijia Chen Xiaotie Deng FudanUniversity PekingUniversity Shanghai, China Beijing,China Mei Lu TsinghuaUniversity Beijing,China ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notesin Computer Science ISBN 978-3-030-18125-3 ISBN978-3-030-18126-0 (eBook) https://doi.org/10.1007/978-3-030-18126-0 LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues ©SpringerNatureSwitzerlandAG2019 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, expressed or implied, with respect to the material contained herein or for any errors or omissionsthatmayhavebeenmade.Thepublisherremainsneutralwithregardtojurisdictionalclaimsin publishedmapsandinstitutionalaffiliations. ThisSpringerimprintispublishedbytheregisteredcompanySpringerNatureSwitzerlandAG Theregisteredcompanyaddressis:Gewerbestrasse11,6330Cham,Switzerland Preface This volume contains the papers presented at FAW 2019: the 13th International Frontiers of Algorithmics Workshop, held during April 29 – May 3, 2019, at the Tsinghua Sanya International Mathematics Forum, in Sanya, P. R. China. The work- shop provides a focused forum on current trends in research on algorithms, discrete structures, and their applications, and brings together international experts at the research frontiers in these areas to exchange ideas and to present significant new results. The Program Committee, consisting of 28 top researchers from the field, reviewed 21submissionsanddecidedtoaccept15papers.Eachpaperhadatleastthreereviews, withadditionalreviewssolicitedasneeded.Thereviewprocesswasconductedentirely electronicallyviaEasyChair.WearegratefultotheEasyChairteamforallowingusto handlethesubmissionsandthereviewprocessandtotheProgramCommitteefortheir insightful reviews and discussions, which made our job easier. Besides the regular talks, the program also included three keynote talks by Yuqing Kong (Peking University), Bundit Laekhanukit (Shanghai University of Finance and Economics), and Jian Li (Tsinghua University). We are very grateful to all the people who made this meeting possible: the authors for submitting their papers, the Program Committee members and external reviewers for their excellent work, and the three keynote speakers. Inparticular,wewouldliketothanktheTsinghuaSanyaInternationalMathematics Forum (TSIMF) for hosting the conference and providing financial and organizational support. In addition to the ordinary FAW conference talks, 20 participating Program Committee members gave talks, organized in several sessions and research mini-workshops on current frontiers of computer science theory and mathematical foundations. In addition, FAW organized several special topic research sessions on approximate algorithms, algorithmic game theory, and parameterized complexity, which were aligned with the keynote speeches. TSIMF allowed FAW to organized a richeventtobringtogethermorethan50activeresearchersforacademicexchangeson the current progress in algorithms and complexity. Finally,wewouldliketothankthemembersoftheEditorialBoardofLectureNotes in Computer Science and the editors at Springer for their encouragement and coop- eration throughout the preparation of this conference. March 2019 Yijia Chen Xiaotie Deng Mei Lu Organization Program Committee Chairs Yijia Chen Fudan University, China Xiaotie Deng Peking University, China Mei Lu Tsinghua University, China Steering Committee Jianer Chen Texas A&M University, USA Xiaotie Deng Peking University, China John E. Hopcroft Cornell University, USA Wei Li Beihang University, China Huimin Lin Chinese Academy of Sciences, China Andrew Chi-Chih Yao Tsinghua University, China Binhai Zhu Montana State University, USA Program Committee Jin-Yi Cai University of Wisconsin - Madison, USA Yixin Cao Hong Kong Polytechnic University, SAR China Xujin Chen Chinese Academy of Sciences, China Yukun Cheng Suzhou University of Science and Technology, China Hu Ding University of Science and Technology of China, China Ran Duan Tsinghua University, China Mordecai J. Golin Hong Kong University of Science and Technology, SAR China Heng Guo University of Edinburgh, UK Zhiyi Huang University of Hong Kong, SAR China Kazuo Iwama Kyoto University, Japan Jian Li Tsinghua University, China Shimin Li Winona State University, USA Minming Li City University of Hong Kong, SAR China Bingkai Lin National Institute of Informatics, Japan Tian Liu Peking University, China Pinyan Lu Shanghai University of Finance and Economics, China Pan Peng University of Sheffield, UK Richard Peng Georgia Institute of Technology, USA Qi Qi Hong Kong University of Science and Technology, SAR China Dominik Scheder Shanghai Jiao Tong University, China Haitao Wang Utah State University, USA viii Organization Mingji Xia Chinese Academy of Sciences, China Deshi Ye Zhejiang University, China Yang Yuan MIT, USA Binhai Zhu Montana State University, USA Additional Reviewers Chenglin Fan Eiji Miyano Yong Gu Cong Wang Yaonan Jin Wenwei Wang Ning Kang Jie Xue Bundit Laekhanukit Chenhao Wang Weian Li Chenchen Wu Xianyue Li Jingru Zhang Jinyan Liu Peng Zhang Contents A Polynomial Time Algorithm for Fair Resource Allocation in Resource Exchange. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Xiang Yan and Wei Zhu A Local Search 4/3-approximation Algorithm for the Minimum 3-path Partition Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu, and An Zhang Efficient Guarding of Polygons and Terrains . . . . . . . . . . . . . . . . . . . . . . . 26 Pradeesha Ashok and Meghana M. Reddy Graph Orientation with Edge Modifications . . . . . . . . . . . . . . . . . . . . . . . . 38 Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, and Sandhya T. P. Local Coloring: New Observations and New Reductions . . . . . . . . . . . . . . . 51 Jie You, Yixin Cao, and Jianxin Wang Secure Computation of Any Boolean Function Based on Any Deck of Cards . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 Kazumasa Shinagawa and Takaaki Mizuki A Novel Business Model for Electric Car Sharing. . . . . . . . . . . . . . . . . . . . 76 Yukun Cheng, Xiaotie Deng, and Mengqian Zhang Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88 Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang, and Ro-Yu Wu Read-Once Resolutions in Horn Formulas . . . . . . . . . . . . . . . . . . . . . . . . . 100 Hans Kleine Büning, P. Wojciechowski, and K. Subramani Vertex-Critical (P , banner)-Free Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . 111 5 Qingqiong Cai, Shenwei Huang, Tao Li, and Yongtang Shi An FPTAS for Stochastic Unbounded Min-Knapsack Problem . . . . . . . . . . . 121 Zhihao Jiang and Haoyu Zhao The Inapproximability of k-DominatingSet for Parameterized AC0 Circuits . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 133 Wenxing Lai x Contents Mutual Visibility by Robots with Persistent Memory. . . . . . . . . . . . . . . . . . 144 Subhash Bhagat and Krishnendu Mukhopadhyaya Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 156 Leszek Gąsieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, and Mia Persson An Improved Approximation Algorithm for the k-Means Problem with Penalties. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 170 Qilong Feng, Zhen Zhang, Feng Shi, and Jianxin Wang Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 183
The list of books you might like
