Overview
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 9711)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: FAW 2016.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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.
Similar content being viewed by others
Keywords
- 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
- algorithm analysis and problem complexity
Table of contents (27 papers)
Other volumes
-
Frontiers in Algorithmics
Reviews
Editors and Affiliations
About the editors
Bibliographic Information
Book Title: Frontiers in Algorithmics
Book Subtitle: 10th International Workshop, FAW 2016, Qingdao, China, June 30- July 2, 2016, Proceedings
Editors: Daming Zhu, Sergey Bereg
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-39817-4
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing Switzerland 2016
Softcover ISBN: 978-3-319-39816-7Published: 27 May 2016
eBook ISBN: 978-3-319-39817-4Published: 10 August 2016
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XVII, 290
Number of Illustrations: 73 b/w illustrations
Topics: Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Computation by Abstract Devices, Data Structures