Frontiers in Algorithmics

10th International Workshop, FAW 2016, Qingdao, China, June 30- July 2, 2016, Proceedings

  • Daming Zhu
  • Sergey Bereg

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9711)

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 9711)

Table of contents

  1. Front Matter
    Pages I-XVII
  2. Thomas Erlebach
    Pages 1-7
  3. Zhi-Zhong Chen, Youta Harada, Eita Machida, Fei Guo, Lusheng Wang
    Pages 17-28
  4. Zihe Chen, Danyang Chen, Xiangyu Wang, Jianping Xiang, Hui Meng, Jinhui Xu
    Pages 29-40
  5. Shaun Fallat, Karen Meagher, Abolghasem Soltani, Boting Yang
    Pages 53-64
  6. Qilong Feng, Xiong Jiang, Jianxin Wang
    Pages 65-74
  7. Qilong Feng, Zeyang Zhou, Jianxin Wang
    Pages 75-83
  8. Yan-Li Liu, Chu-Min Li, Kun He, Yi Fan
    Pages 111-124
  9. Yunlong Liu, Jianxin Wang
    Pages 125-134
  10. Kelin Luo, Yinfeng Xu, Xin Feng
    Pages 135-144
  11. Yuzhe Ma, Kun He, John Hopcroft, Pan Shi
    Pages 158-171
  12. Lili Mei, Deshi Ye, Guochuan Zhang
    Pages 172-182
  13. Li Ning, Zhongying Zhao, Rong Zhou, Yong Zhang, Shengzhong Feng
    Pages 183-193

About these proceedings


This book constitutes the proceedings of the 10th International Workshop on Frontiers in Algorithmics, FAW 2016, held in Qingdao, China, in June/July 2016.      

The 25 full papers presented in this volume were carefully reviewed and selected from 54 submissions. They deal with algorithm, complexity, problem, reduction, NP-complete, graph, approximation, linear programming, local search, integer programming, semidefinite programming, parameterized algorithm, fixed parameter, tractability, randomness, computational geometry.      


complexity linear programming online algorithms optimization virtual machines algorithm approximation computational geometry dimension reduction fixed parameter tractability graph hybrid architectures integer programming local search NP-Completeness parallel algorithm parameterized algorithm problem randomness semidefinite programming

Editors and affiliations

  • Daming Zhu
    • 1
  • Sergey Bereg
    • 2
  1. 1.Shandong UniversityJinanChina
  2. 2.MS EC-31University of Texas at DallasRichardsonUSA

Bibliographic information

  • DOI
  • Copyright Information Springer International Publishing Switzerland 2016
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-39816-7
  • Online ISBN 978-3-319-39817-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book