Frontiers in Algorithmics: 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings

343 Pages·2015·12.207 MB·English

by  Jianxin Wang, Chee Yap (eds.)

Jianxin Wang
Chee Yap (Eds.)
0 Frontiers
3
1
9

S
in Algorithmics
C
N
L
9th International Workshop, FAW 2015
Guilin, China, July 3–5, 2015
Proceedings
123
Lecture Notes in Computer Science 9130
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
Jianxin Wang Chee Yap (Eds.)
(cid:129)
Frontiers
in Algorithmics
9th International Workshop, FAW 2015
–
Guilin, China, July 3 5, 2015
Proceedings
123
Editors
Jianxin Wang Chee Yap
Central SouthUniversity CourantInstitute
Changsha NewYork University
China NewYork,NY
USA
ISSN 0302-9743 ISSN 1611-3349 (electronic)
Lecture Notesin Computer Science
ISBN 978-3-319-19646-6 ISBN978-3-319-19647-3 (eBook)
DOI 10.1007/978-3-319-19647-3
LibraryofCongressControlNumber:2015940411
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 International Frontiers of Algorithmics Workshop (FAW 2015) was held
during July 3–5, 2015, at Guilin, China. The workshop brings together researchers
working on all aspects of computer science for the exchange of ideas and results.
FAW2015wastheninthconferenceintheseries.Thepreviouseightmeetingswere
heldduringAugust1–3,2007,inLanzhou,June19–21,2008,inChangsha,June20–23,
2009, in Hefei, August 11–13, 2010, in Wuhan, May 28–31, 2011, in Jinhua, May
14–16,2012,inBeijing,June26–28,2013,inDalian,June28–30,2014,inZhangjiajie.
Inall, 65submissions werereceivedfrom more than 12countries andregions.The
FAW 2015 Program Committee selected 28 papers for presentation at the conference.
In addition, we had two plenary speakers: Fedor Fomin (University of Bergen,
Norway) and Chee Yap (New York University, USA). Many thanks for their contri-
butions to the conference and proceedings.
WewouldliketothanktheProgramCommitteemembersandexternalreviewersfor
their hard work in reviewing and selecting papers. We are also very grateful to all the
authors who submitted their work to FAW 2015. Finally, we would like to thank the
editors at Springer and the local organization chairs for their hard work in the prepa-
ration of this conference.
July 2015 Jianxin Wang
Chee Yap
Organization
Program Committee
Hee-Kap Ahn Pohang University of Science and Technology, Korea
Hans L. Bodlaender Utrecht University, The Netherlands
Yixin Cao Hong Kong Polytechnic University, China
Marek Chrobak University of California, Riverside, USA
Barry Cooper University of Leeds, UK
Qilong Feng Central South University, China
Henning Fernau University of Trier, Germany
Mordecai J. Golin Hong Kong University of Science and Technology,
China
Jiong Guo Shandong University, China
Gregory Z. Gutin University of London, UK
Kun He Huazhong University of Science and Technology,
China
Tomio Hirata Nagoya University, Japan
Hiro Ito University of Electro-Communications, Japan
Klaus Jansen University of Kiel, Germany
Iyad Kanj DePaul University, USA
Ming-Yang Kao Northwestern University, USA
Naoki Katoh Kyoto University, Japan
Michael A. Langston University of Tennessee, USA
Guohui Lin University of Alberta, Canada
Tian Liu Peking University, China
Daniel Lokshtanov University of California San Diego, USA
Dániel Marx Hungarian Academy of Sciences, Hungary
Venkatesh Raman Institute of Mathematical Sciences, India
Ulrike Stege University of Victoria, Canada
Xiaoming Sun Institute of Computing Technology, CAS, China
Jianxin Wang (Co-chair) Central South University, China
Gerhard J. Woeginger EindhovenUniversityofTechnology,TheNetherlands
Ge Xia Lafayette College, USA
Ke Xu Beihang University, China
Boting Yang University of Regina, Canada
Chee Yap (Co-chair) New York University, USA
Binhai Zhu Montana State University, USA
Xiaofeng Zhu Guangxi Normal University, China
VIII Organization
General Conference Chairs
John Hopcroft Cornell University, USA
Shichao Zhang University of Technology, Sydney, Australia
Program Chairs
Jianxin Wang Central South University, China
Chee Yap New York University, USA
Publication Chairs
Yixin Cao Hong Kong Polytechnic University, China
Xiaofeng Zhu Guangxi Normal University, China
Organizing Chairs
Qilong Feng Central South University, China
Zhenjun Tang Guangxi Normal University, China
Additional Reviewers
Andro-Vasko, James Kawahara, Jun Panolan, Fahad
Bae, Sang Won Kawamura, Akitoshi Park, Dongwoo
Barbero, Florian Kehua, Guo Pferschy, Ulrich
Belmonte, Rémy Kellerer, Hans Phillips, Charles
Brodal, Gerth Stølting Kim, Min-Gyu Proietti, Guido
Buchanan, Austin Kim, Sang-Sub Reinhardt, Klaus
Bulteau, Laurent Kullmann, Oliver Seto, Kazuhisa
Cai, Leizhen Li, Minming Sheng, Bin
Chen, Xujin Li, Wenjun Solis-Oba, Roberto
Cho, Dae-Hyeong Liu, Xingwu Stee, Rob Van
Dutot, Pierre-Francois Lu, Allan Yuping Strusevich, Vitaly
Epstein, Leah Lu, Songjian Teruyama, Junichi
Fata, Elaheh M.S., Ramanujan Thorup, Mikkel
Fujiwara, Hiroshi Majumdar, Diptapriyo Trevisan, Vilmar
Gagarin, Andrei Mastrolilli, Monaldo Wakatsuki, Mitsuo
Hagan, Ron Mertzios, George Wang, Kai
Higashikawa, Yuya Misra, Neeldhara Yoon, Sang-Duk
Jacobs, David Miyazawa, Flavio K. You, Jie
Jiang, Minghui Nielsen, Jesper Sindahl Zhang, Jialin
Jones, Mark Oh, Eunjin
Kaluza, Maren Okamoto, Yoshio
Contents
Invited Talks
Graph Modification Problems: A Modern Perspective . . . . . . . . . . . . . . . . . 3
Fedor V. Fomin, Saket Saurabh, and Neeldhara Misra
Soft Subdivision Search in Motion Planning, II: Axiomatics. . . . . . . . . . . . . 7
Chee K. Yap
Contributed Papers
On r-Gatherings on the Line. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
Toshihiro Akagi and Shin-ichi Nakano
A New Algorithm for Intermediate Dataset Storage
in a Cloud-Based Dataflow . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33
Jie Cheng, Daming Zhu, and Binhai Zhu
Efficient Computation of the Characteristic Polynomial
of a Threshold Graph . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45
Martin Fürer
A Fast and Practical Method to Estimate Volumes of Convex Polytopes . . . . 52
Cunjing Ge and Feifei Ma
Social Models and Algorithms for Optimization of Contact Immunity
of Oral Polio Vaccine . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66
Chengwei Guo, Chenglong Ma, and Shengyu Zhang
The Directed Dominating Set Problem: Generalized Leaf Removal
and Belief Propagation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 78
Yusupjan Habibulla, Jin-Hua Zhao, and Hai-Jun Zhou
A Linear Time Algorithm for Ordered Partition . . . . . . . . . . . . . . . . . . . . . 89
Yijie Han
Machine Scheduling with a Maintenance Interval and Job Delivery
Coordination. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 104
Jueliang Hu, Taibo Luo, Xiaotong Su, Jianming Dong, Weitian Tong,
Randy Goebel, Yinfeng Xu, and Guohui Lin
Lower and Upper Bounds for Random Mimimum Satisfiability Problem . . . . 115
Ping Huang and Kaile Su
X Contents
On Solving Systems ofDiagonal Polynomial Equations Over Finite Fields. . . 125
Gábor Ivanyos and Miklos Santha
Pattern Backtracking Algorithm for the Workflow Satisfiability Problem
with User-Independent Constraints . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 138
Daniel Karapetyan, Andrei Gagarin, and Gregory Gutin
On the Sound Covering Cycle Problem in Paired de Bruijn Graphs. . . . . . . . 150
Christian Komusiewicz and Andreea Radulescu
Approximation Algorithms for the Multilevel Facility Location Problem
with Linear/Submodular Penalties . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 162
Gaidi Li, Dachuan Xu, Donglei Du, and Chenchen Wu
Smaller Kernels for Several FPT Problems Based on Simple Observations. . . 170
Wenjun Li and Shuai Hu
ParameterizedMinimumCostPartitionofaTreewithSupplyandDemand .... 180
Mugang Lin, Wenjun Li, and Qilong Feng
The Online Storage Strategy for Automated Storage and Retrieval System
with Single Open in One Dimension. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 190
Henan Liu and Yinfeng Xu
Union Closed Tree Convex Sets. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 198
Tian Liu and Ke Xu
Fast Quantum Algorithms for Least Squares Regression and Statistic
Leverage Scores . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 204
Yang Liu and Shengyu Zhang
A New Distributed Algorithm for Computing a Dominating Set on Grids . . . 217
Photchchara Pisantechakool and Xuehou Tan
Approximate Model Counting via Extension Rule. . . . . . . . . . . . . . . . . . . . 229
Jinyan Wang, Minghao Yin, and Jingli Wu
Improved Information Set Decoding for Code-Based Cryptosystems
with Constrained Memory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 241
Maoning Wang and Mingjie Liu
Truthful Strategy and Resource Integration for Multi-tenant Data Center
Demand Response. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 259
Youshi Wang, Fa Zhang, and Zhiyong Liu
Local Search to Approximate Max NAE-k-Sat Tightly. . . . . . . . . . . . . . . . . 271
Aiyong Xian, Kaiyuan Zhu, Daming Zhu, and Lianrong Pu