Advertisement

Frontiers in Algorithmics

11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings

  • Mingyu Xiao
  • Frances Rosamond
Conference proceedings FAW 2017

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

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

Table of contents

  1. Front Matter
    Pages I-X
  2. Eric Angel, Evripidis Bampis, Vincent Chau, Vassilis Zissimopoulos
    Pages 1-12
  3. Sergey Bereg, Feifei Ma, Wencheng Wang, Jian Zhang, Binhai Zhu
    Pages 13-21
  4. Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti
    Pages 22-33
  5. Shota Yuasa, Zhi-Zhong Chen, Bin Ma, Lusheng Wang
    Pages 79-90
  6. Jian Gao, Rong Chen, Minghao Yin, Hui Li
    Pages 91-102
  7. Xin Han, Ning Ma, Kazuhisa Makino, He Chen
    Pages 103-114
  8. Faisal N. Abu-Khzam, Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan
    Pages 139-150
  9. Weidong Li, Xi Liu, Xiaolu Zhang, Xuejie Zhang
    Pages 163-174
  10. Wenjun Li, Haiyan Liu, Jianxin Wang, Lingyun Xiang, Yongjie Yang
    Pages 175-186
  11. Kelin Luo, Yinfeng Xu, Huili Zhang, Wei Luo
    Pages 187-195
  12. Jingjing Ma, Haitao Jiang, Daming Zhu, Shu Zhang
    Pages 196-208
  13. Yue-Li Wang
    Pages 233-240
  14. Guangwei Wu, Jianer Chen, Jianxin Wang
    Pages 241-253
  15. Junping Zhou, Shuli Hu, Tingting Zou, Minghao Yin
    Pages 267-279
  16. Back Matter
    Pages 281-281

About these proceedings

Introduction

This book constitutes the proceedings of the 11th International Workshop on Frontiers in Algorithmics, FAW 2017, held in Chengdu, China, in June 2017.
The 24 papers presented in this volume were carefully reviewed and selected from 61 submissions. They deal with all aspects of theoretical computer science and algorithms.

Keywords

graph theory approximation algorithms problem solving approximation theory optimal systems competitive ratio graph theory vertex set probabilistic computation proof complexity graph algorithms analysis mathematical optimization online algorithms parameterized complexity exact algorithms algorithmic game theory

Editors and affiliations

  1. 1.University of Electronic Science and Technology of ChinaChengduChina
  2. 2.University of BergenBergenNorway

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-59605-1
  • Copyright Information Springer International Publishing AG 2017
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-59604-4
  • Online ISBN 978-3-319-59605-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Electronics
IT & Software
Telecommunications
Engineering