000 03943nam a22006495i 4500
001 978-3-030-18126-0
003 DE-He213
005 20240423125046.0
007 cr nn 008mamaa
008 190408s2019 sz | s |||| 0|eng d
020 _a9783030181260
_9978-3-030-18126-0
024 7 _a10.1007/978-3-030-18126-0
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aFrontiers in Algorithmics
_h[electronic resource] :
_b13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings /
_cedited by Yijia Chen, Xiaotie Deng, Mei Lu.
250 _a1st ed. 2019.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2019.
300 _aX, 183 p. 83 illus., 19 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v11458
505 0 _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. .
520 _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.
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aNumerical analysis.
650 0 _aArtificial intelligence
_xData processing.
650 0 _aComputer networks .
650 0 _aArtificial intelligence.
650 1 4 _aAlgorithms.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aNumerical Analysis.
650 2 4 _aData Science.
650 2 4 _aComputer Communication Networks.
650 2 4 _aArtificial Intelligence.
700 1 _aChen, Yijia.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aDeng, Xiaotie.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aLu, Mei.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030181253
776 0 8 _iPrinted edition:
_z9783030181277
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v11458
856 4 0 _uhttps://doi.org/10.1007/978-3-030-18126-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c173759
_d173759