LEADER 04136nam 22007695 450 001 9910337854103321 005 20230329154757.0 010 $a3-030-18126-X 024 7 $a10.1007/978-3-030-18126-0 035 $a(CKB)4100000007938099 035 $a(DE-He213)978-3-030-18126-0 035 $a(MiAaPQ)EBC5924778 035 $a(PPN)23566863X 035 $a(EXLCZ)994100000007938099 100 $a20190408d2019 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aFrontiers in Algorithmics $e13th International Workshop, FAW 2019, Sanya, China, April 29 ? May 3, 2019, Proceedings /$fedited by Yijia Chen, Xiaotie Deng, Mei Lu 205 $a1st ed. 2019. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2019. 215 $a1 online resource (X, 183 p. 83 illus., 19 illus. in color.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11458 311 $a3-030-18125-1 327 $aA 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. . 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11458 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aArtificial intelligence?Data processing 606 $aComputer networks 606 $aArtificial intelligence 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aData Science 606 $aComputer Communication Networks 606 $aArtificial Intelligence 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aArtificial intelligence?Data processing. 615 0$aComputer networks. 615 0$aArtificial intelligence. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 615 24$aData Science. 615 24$aComputer Communication Networks. 615 24$aArtificial Intelligence. 676 $a005.1 676 $a005.1 702 $aChen$b Yijia$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aDeng$b Xiaotie$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLu$b Mei$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910337854103321 996 $aFrontiers in algorithmics$958649 997 $aUNINA