Frontiers in Algorithmics 13th International Workshop, FAW 2019, Sanya, China, April 29 - May 3, 2019, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Chen, Yijia (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Deng, Xiaotie (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Lu, Mei (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2019.
• Έκδοση: 1st ed. 2019.
• Σειρά: Theoretical Computer Science and General Issues ; 11458
• Θέματα: Algorithms.; Computer science-Mathematics.; Numerical analysis.; Data structures (Computer science).; Computer communication systems.; Artificial intelligence.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Numeric Computing.; Data Structures.; Computer Communication Networks.; Artificial Intelligence.

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 cur...

Πίνακας περιεχομένων:

• 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. .