Algorithmic Aspects in Information and Management: 13th International Conference, AAIM 2019, Beijing, China, August 6–8, 2019, Proceedings

363 Pages·2019·8.202 MB·English

by  Ding-Zhu Du, Lian Li, Xiaoming Sun, Jialin Zhang

Ding-Zhu Du · Lian Li ·
Xiaoming Sun · Jialin Zhang (Eds.)
Algorithmic Aspects
0
4 in Information
6
1
1

S
and Management
C
N
L
13th International Conference, AAIM 2019
Beijing, China, August 6–8, 2019
Proceedings
Lecture Notes in Computer Science 11640
Founding Editors
Gerhard Goos
Karlsruhe Institute of Technology, Karlsruhe, Germany
Juris Hartmanis
Cornell University, Ithaca, NY, USA
Editorial Board Members
Elisa Bertino
Purdue University, West Lafayette, IN, USA
Wen Gao
Peking University, Beijing, China
Bernhard Steffen
TU Dortmund University, Dortmund, Germany
Gerhard Woeginger
RWTH Aachen, Aachen, Germany
Moti Yung
Columbia University, New York, NY, USA
More information about this series at http://www.springer.com/series/7407
Ding-Zhu Du Lian Li
(cid:129) (cid:129)
Xiaoming Sun Jialin Zhang (Eds.)
(cid:129)
Algorithmic Aspects
in Information
and Management
13th International Conference, AAIM 2019
–
Beijing, China, August 6 8, 2019
Proceedings
123
Editors
Ding-Zhu Du LianLi
TheUniversity of Texasat Dallas Hefei University of Technology
Richardson, TX, USA Hefei, China
Xiaoming Sun JialinZhang
Institute of Computing Technology, Institute of Computing Technology,
ChineseAcademy of Sciences ChineseAcademy of Sciences
Beijing,China Beijing,China
ISSN 0302-9743 ISSN 1611-3349 (electronic)
Lecture Notesin Computer Science
ISBN 978-3-030-27194-7 ISBN978-3-030-27195-4 (eBook)
https://doi.org/10.1007/978-3-030-27195-4
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
The 13th International Conference on Algorithmic Aspects in Information and
Management (AAIM 2019), was held in Beijing, China, during August 6–8, 2019.
TheAAIMconferenceseries,whichstartedin2005inXi’an,China,aimstostimulate
the various fields for which algorithmics has become a crucial enabler, and to
strengthen the ties between the Eastern and Western research communities of algo-
rithmics and applications.
Thetopicscovermostaspectsoftheoreticalcomputerscienceandtheirapplications.
Both theoretical and experimental/applied works of general algorithmic interest were
sought. Special considerations were given to algorithmic research that was motivated
by real-world applications. Experimental and applied papers were expected to show
convincinglytheusefulnessandefficiencyofthetargetalgorithmsinpracticalsettings.
We would like to thank the two eminent keynote speakers, Xiaotie Deng from
Peking University, and David Woodruff from Carnegie Mellon University, for their
contribution to the conference.
We would like to express our appreciation to all members of the Program Com-
mittee and the external referees whose efforts enabled us to achieve a high scientific
standard for the proceedings. We would like to thank all members of the Organizing
Committee for their assistance and contribution which attributed to the success of the
conference. We would like to thank Alfred Hofmann, Anna Kramer, and their col-
leagues at Springer for meticulously supporting us in the timely production of this
volume. Last but not least, our special thanks go to all the authors who submitted
papers and all the participants for their contributions to the success of this event.
June 2019 Ding-Zhu Du
Lian Li
Xiaoming Sun
Jialin Zhang
Organization
Program Committee
Zhipeng Cai Georgia State University, USA
Lichao Chen Google, USA
Yongxi Cheng Xi’an Jiaotong University, China
Ding-Zhu Du The University of Texas at Dallas, USA
Andras Farago The University of Texas at Dallas, USA
Xiaofeng Gao Shanghai Jiao Tong University, China
Donghyun Kim Kennesaw State University, USA
Lian Li Hefei University of Technology, China
Minming Li City University of Hong Kong, SAR China
Xiaoming Sun Institute of Computing Technology,
Chinese Academy of Sciences, China
Cong Tian Xidian University, China
Guochuan Zhang Zhejiang University, China
Jialin Zhang Institute of Computing Technology,
Chinese Academy of Sciences, China
Peng Zhang School of Computer Science and Technology,
Shandong University, China
Zhao Zhang Zhejiang Normal University, China
Additional Reviewers
Chen, Hua Wang, Changjun
Cheng, Yukun Wu, Chenchen
Gan, Jinxiang Xu, Chenyang
Hao, Jie Xu, Yicheng
Khan, Fanid Yao, Yuhao
Li, Minming Zhang, Jia
Liu, Bei Zhang, Ruilong
Mei, Lili Zhao, Yingchao
Shan, Xiaohan Zhu, Shenglong
Tao, Liangde
Contents
One-Dimensional r-Gathering Under Uncertainty . . . . . . . . . . . . . . . . . . . . 1
Shareef Ahmed, Shin-ichi Nakano, and Md. Saidur Rahman
Improved Algorithms for Ranking and Unranking (k, m)-Ary Trees. . . . . . . . 16
Yu-HsuanChang,Ro-YuWu,Ruay-ShiungChang,andJou-MingChang
A Probabilistic Algorithm for Verification of Geometric Theorems . . . . . . . . 29
Mingyan Chen and Zhenbing Zeng
Approximating Closest Vector Problem in ‘1 Norm Revisited . . . . . . . . . . . 42
Wenbin Chen and Jianer Chen
Low-Dimensional Vectors with Density Bounded by 5/6 Are
Pinwheel Schedulable . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51
Wei Ding
Constant-Factor Greedy Algorithms for the Asymmetric p-Center
Problem in Parameterized Complete Digraphs. . . . . . . . . . . . . . . . . . . . . . . 62
Wei Ding and Ke Qiu
Updating Matrix Polynomials. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72
Wei Ding and Ke Qiu
On the Structure of Discrete Metric Spaces Isometric to Circles . . . . . . . . . . 83
Andreas W. M. Dress, Hiroshi Maehara, Sabrina Xing Mei Pang,
and Zhenbing Zeng
A 2.57-Approximation Algorithm for Contig-Based Genomic
Scaffold Filling. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95
Qilong Feng, Xiangzhong Meng, Guanlan Tan, and Jianxin Wang
Profit Parameterizations of DOMINATING SET . . . . . . . . . . . . . . . . . . . . . . . . 108
Henning Fernau and Ulrike Stege
Exponential Time Approximation Scheme for TSP . . . . . . . . . . . . . . . . . . . 121
Zhixiang Chen, Qilong Feng, Bin Fu, Mugang Lin, and Jianxin Wang
Interaction-Aware Influence Maximization and Iterated Sandwich Method . . . 129
Chuangen Gao, Shuyang Gu, Ruiqi Yang, Jiguo Yu, Weili Wu,
and Dachuan Xu
viii Contents
On Approximation Algorithm for the Edge Metric Dimension Problem . . . . . 142
Yufei Huang, Bo Hou, Wen Liu, Lidong Wu, Stephen Rainwater,
and Suogang Gao
The Seeding Algorithm for Spherical k-Means Clustering with Penalties . . . . 149
Sai Ji, Dachuan Xu, Longkun Guo, Min Li, and Dongmei Zhang
Approximation Algorithm for the Correlation Clustering Problem
with Non-uniform Hard Constrained Cluster Sizes. . . . . . . . . . . . . . . . . . . . 159
Sai Ji, Dachuan Xu, Min Li, and Yishui Wang
Two-Way Currency Trading Algorithms in the Discrete Setting . . . . . . . . . . 169
Fei Li
Approximation Algorithms for the Minimum Power Partial
Cover Problem. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 179
Menghong Li, Yingli Ran, and Zhao Zhang
On Approximations for Constructing Required Subgraphs Using Stock
Pieces of Fixed Length . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 192
Junran Lichen, Jianping Li, Ko-Wei Lih, and Xingxing Yu
A Primal Dual Approximation Algorithm for the Multicut Problem
in Trees with Submodular Penalties. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 203
Xiaofei Liu and Weidong Li
Algorithmic Aspect on the Minimum (Weighted) Doubly Resolving Set
Problem of Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 212
Changhong Lu, Qingjie Ye, and Chengru Zhu
Trajectory Optimization of UAV for Efficient Data Collection
from Wireless Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 223
Chuanwen Luo, Lidong Wu, Wenping Chen, Yongcai Wang, Deying Li,
and Weili Wu
Locality Sensitive Algotrithms for Data Mule Routing Problem . . . . . . . . . . 236
Pablo L. A. Munhoz, Felipe P. do Carmo, Uéverton S. Souza,
Lúcia M. A. Drummond, Pedro Henrique González, Luiz S. Ochi,
and Philippe Michelon
Maximize a Monotone Function with a Generic Submodularity Ratio . . . . . . 249
Qingqin Nong, Tao Sun, Suning Gong, Qizhi Fang, Dingzhu Du,
and Xiaoyu Shao
Approximation Algorithm for Stochastic Prize-Collecting Steiner
Tree Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 261
Jian Sun, Haiyun Sheng, Yuefang Sun, and Xiaoyan Zhang
Contents ix
A General Framework for Path Convexities . . . . . . . . . . . . . . . . . . . . . . . . 272
João Vinicius C. Thompson, Loana T. Nogueira, Fábio Protti,
Raquel S. F. Bravo, Mitre C. Dourado, and Uéverton S. Souza
An Approximation Algorithm for the Dynamic k-level Facility
Location Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 284
Limin Wang, Zhao Zhang, Dachuan Xu, and Xiaoyan Zhang
Weighted Two-Dimensional Finite Automata . . . . . . . . . . . . . . . . . . . . . . . 292
Qichao Wang, Yongming Li, and Wei Zhou
Improved Parameterized Algorithms for Mixed Domination . . . . . . . . . . . . . 304
Mingyu Xiao and Zimo Sheng
New Results on the Zero-Visibility Cops and Robber Game. . . . . . . . . . . . . 316
Yuan Xue, Boting Yang, and Sandra Zilles
A Two-Stage Constrained Submodular Maximization . . . . . . . . . . . . . . . . . 329
Ruiqi Yang, Shuyang Gu, Chuangen Gao, Weili Wu, Hua Wang,
and Dachuan Xu
Local Search Approximation Algorithms for the Spherical
k-Means Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 341
Dongmei Zhang, Yukun Cheng, Min Li, Yishui Wang, and Dachuan Xu
Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 353