Frontiers in Algorithmics  10th International Workshop, FAW 2016, Qingdao, China, June 30- July 2, 2016, Proceedings /  [electronic resource] : 
edited by Daming Zhu, Sergey Bereg. 
 - 1st ed. 2016. 
 - XVII, 290 p. 73 illus.  online resource. 
 - Theoretical Computer Science and General Issues,  9711  2512-2029 ; .
 - Theoretical Computer Science and General Issues,  9711 .
<br/><br/>Algorithm -- Complexity -- Problem -- Reduction -- NP-complete -- Graph.-Approximation -- Linear programming -- Local search -- Integer programming.-Semidefinite programming -- Parameterized algorithm.-Fixed parameter.-Tra ctability -- Randomness -- Computational Geometry. . 
<br/><br/> 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. . 
<br/><br/><label>ISBN: </label>9783319398174 
<br/><br/><label>Standard No.: </label>10.1007/978-3-319-39817-4  doi 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Algorithms.<br/>Computer science--Mathematics.<br/>Discrete mathematics.<br/>Computer science.<br/>Artificial intelligence--Data processing.<br/>Algorithms.<br/>Discrete Mathematics in Computer Science.<br/>Theory of Computation.<br/>Data Science.
<br/><br/><label>LC Class. No.: </label>QA76.9.A43 
<br/><br/><label>Dewey Class. No.: </label>518.1