×

zbMATH — the first resource for mathematics

Frontiers in algorithmics. 10th international workshop, FAW 2016, Qingdao, China, June 30 – July 2, 2016. Proceedings. (English) Zbl 1407.68047
Lecture Notes in Computer Science 9711. Cham: Springer (ISBN 978-3-319-39816-7/pbk; 978-3-319-39817-4/ebook). xvii, 290 p. (2016).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding workshop see [Zbl 1314.68017].
Indexed articles:
Erlebach, Thomas, Algorithms for queryable uncertainty, 1-7 [Zbl 07048068]
Zhu, Binhai, Genomic scaffold filling: a progress report, 8-16 [Zbl 07048069]
Chen, Zhi-Zhong; Harada, Youta; Machida, Eita; Guo, Fei; Wang, Lusheng, Better approximation algorithms for scaffolding problems, 17-28 [Zbl 07048070]
Chen, Zihe; Chen, Danyang; Wang, Xiangyu; Xiang, Jianping; Meng, Hui; Xu, Jinhui, How to block blood flow by using elastic coil, 29-40 [Zbl 07048071]
Das, Sandip; Nandy, Ayan; Sarvottamananda, Swami, Linear time algorithm for 1-center in \(\mathfrak {R}^d\) under convex polyhedral distance function, 41-52 [Zbl 07048072]
Fallat, Shaun; Meagher, Karen; Soltani, Abolghasem; Yang, Boting, Positive zero forcing and edge clique coverings, 53-64 [Zbl 07048073]
Feng, Qilong; Jiang, Xiong; Wang, Jianxin, Improved algorithms for several parameterized problems based on random methods, 65-74 [Zbl 07048074]
Feng, Qilong; Zhou, Zeyang; Wang, Jianxin, Parameterized algorithms for maximum edge biclique and related problems, 75-83 [Zbl 07048075]
Hong, He; Boyan, Cao, The scheduling strategy of virtual machine migration based on the gray forecasting model, 84-91 [Zbl 07048076]
Li, Xingfu; Feng, Haodi; Jiang, Haitao; Zhu, Binhai, A polynomial time algorithm for finding a spanning tree with maximum number of internal vertices on interval graphs, 92-101 [Zbl 07048077]
Liu, Tian, Fractional edge cover number of model RB, 102-110 [Zbl 07048078]
Liu, Yan-Li; Li, Chu-Min; He, Kun; Fan, Yi, Breaking cycle structure to improve lower bound for Max-SAT, 111-124 [Zbl 07048079]
Liu, Yunlong; Wang, Jianxin, On counting parameterized matching and packing, 125-134 [Zbl 07048080]
Luo, Kelin; Xu, Yinfeng; Feng, Xin, Online scheduling with increasing subsequence serving constraint, 135-144 [Zbl 07048081]
Ma, Jingjing; Jiang, Haitao, Notes on the \(\frac{6}{5}\)-approximation algorithm for one-sided scaffold filling, 145-157 [Zbl 07048082]
Ma, Yuzhe; He, Kun; Hopcroft, John; Shi, Pan, Nonlinear dimension reduction by local multidimensional scaling, 158-171 [Zbl 07048083]
Mei, Lili; Ye, Deshi; Zhang, Guochuan, Mechanism design for one-facility location game with obnoxious effects, 172-182 [Zbl 07048084]
Ning, Li; Zhao, Zhongying; Zhou, Rong; Zhang, Yong; Feng, Shengzhong, Realtime channel recommendation: switch smartly while watching TV, 183-193 [Zbl 07048085]
Peng, Wei; Wang, Dongxia; Jiang, Xinwen, Empirical study of phase transition of Hamiltonian cycle problem in random graphs with degrees greater than one, 194-204 [Zbl 07048086]
Pu, Lianrong; Jiang, Haitao, Can a breakpoint graph be decomposed into none other than 2-cycles?, 205-214 [Zbl 07048087]
Tomita, Etsuji; Yoshida, Kohei; Hatta, Takuro; Nagao, Atsuki; Ito, Hiro; Wakatsuki, Mitsuo, A much faster branch-and-bound algorithm for finding a maximum clique, 215-226 [Zbl 07048088]
Tong, Weitian; Miyano, Eiji; Goebel, Randy; Lin, Guohui, A PTAS for the multiple parallel identical multi-stage flow-shops to minimize the makespan, 227-237 [Zbl 07048089]
Yang, Yongjie; Shrestha, Yash Raj; Li, Wenjun; Guo, Jiong, Kernelization of two path searching problems on split graphs, 238-249 [Zbl 07048090]
Zhao, Hongluan; Han, Guoyong; Xu, Gongwen, The bounded batch scheduling with common due window and non-identical size jobs, 250-256 [Zbl 07048091]
Zhong, Cheng; Zhang, Jing; Hua, Bei; Yang, Feng; Liu, Zhengping, Parallel identifying (\(l\),\(d\))-motifs in biosequences using CPU and GPU computing, 257-268 [Zbl 07048092]
Zhou, Guangyan, On the lower bounds of random MAX 3 and 4-SAT, 269-278 [Zbl 07048093]
Zou, Peng; Li, Hui; Xin, Chunlin; Wang, Wencheng; Zhu, Binhai, Finding disjoint dense clubs in an undirected graph, 279-288 [Zbl 07048094]

MSC:
68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68Wxx Algorithms in computer science
00B25 Proceedings of conferences of miscellaneous specific interest
PDF BibTeX XML Cite
Full Text: DOI