Frontiers in Algorithmics 13th International Workshop, FAW 2019, Sanya, China, April 29 - May 3, 2019, Proceedings / [electronic resource] :
edited by Yijia Chen, Xiaotie Deng, Mei Lu.
- 1st ed. 2019.
- X, 183 p. 83 illus., 19 illus. in color. online resource.
- Theoretical Computer Science and General Issues, 11458 2512-2029 ; .
- Theoretical Computer Science and General Issues, 11458 .
A Polynomial Time Algorithm for Fair Resource Allocation in Resource Exchange -- A Local Search 4=3-Approximation Algorithm for the Minimum 3-Path Partition Problem -- Efficient Guarding of Polygons and Terrains -- Graph Orientation with Edge Modifications -- Local Coloring: New Observations and New Reductions -- Secure Computation of Any Boolean Function Based on Any Deck of Cards -- A Novel Business Model for Electric Car Sharing -- Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes- Read-Once Resolutions in Horn Formulas -- Vertex-Critical (P5 ,banner)-Free Graphs -- An FPTAS for Stochastic Unbounded Min-Knapsack Problem -- The Inapproximability of k-DominatingSet for Parameterized AC0 Circuits -- Mutual Visibility by Robots with Persistent Memory -- Pushing the Online Matrix-vector Conjecture Off-line and Identifying Its Easy Cases -- An Improved Approximation Algorithm for the k-Means Problem with Penalties. .
This book constitutes the proceedings of the 13th International Workshop on Frontiers in Algorithmics, FAW 2019, held in Sanya, China, in April/May 2019. The 15 full papers presented in this volume were carefully reviewed and selected from 21 submissions. The workshop provides a focused forum on current trends of research on algorithms, discrete structures, and their applications, and brings together international experts at the research frontiers in these areas to exchange ideas and to present significant new results.
9783030181260
10.1007/978-3-030-18126-0 doi
Algorithms.
Computer science--Mathematics.
Discrete mathematics.
Numerical analysis.
Artificial intelligence--Data processing.
Computer networks .
Artificial intelligence.
Algorithms.
Discrete Mathematics in Computer Science.
Numerical Analysis.
Data Science.
Computer Communication Networks.
Artificial Intelligence.
QA76.9.A43
518.1
A Polynomial Time Algorithm for Fair Resource Allocation in Resource Exchange -- A Local Search 4=3-Approximation Algorithm for the Minimum 3-Path Partition Problem -- Efficient Guarding of Polygons and Terrains -- Graph Orientation with Edge Modifications -- Local Coloring: New Observations and New Reductions -- Secure Computation of Any Boolean Function Based on Any Deck of Cards -- A Novel Business Model for Electric Car Sharing -- Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes- Read-Once Resolutions in Horn Formulas -- Vertex-Critical (P5 ,banner)-Free Graphs -- An FPTAS for Stochastic Unbounded Min-Knapsack Problem -- The Inapproximability of k-DominatingSet for Parameterized AC0 Circuits -- Mutual Visibility by Robots with Persistent Memory -- Pushing the Online Matrix-vector Conjecture Off-line and Identifying Its Easy Cases -- An Improved Approximation Algorithm for the k-Means Problem with Penalties. .
This book constitutes the proceedings of the 13th International Workshop on Frontiers in Algorithmics, FAW 2019, held in Sanya, China, in April/May 2019. The 15 full papers presented in this volume were carefully reviewed and selected from 21 submissions. The workshop provides a focused forum on current trends of research on algorithms, discrete structures, and their applications, and brings together international experts at the research frontiers in these areas to exchange ideas and to present significant new results.
9783030181260
10.1007/978-3-030-18126-0 doi
Algorithms.
Computer science--Mathematics.
Discrete mathematics.
Numerical analysis.
Artificial intelligence--Data processing.
Computer networks .
Artificial intelligence.
Algorithms.
Discrete Mathematics in Computer Science.
Numerical Analysis.
Data Science.
Computer Communication Networks.
Artificial Intelligence.
QA76.9.A43
518.1