國立虎尾科技大學 |

Algorithmic Aspects in Information and Management = 13th International Conference, AAIM 2019, Beijing, China, August 6–8, 2019, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Algorithmic Aspects in Information and Management/ edited by Ding-Zhu Du, Lian Li, Xiaoming Sun, Jialin Zhang.
Reminder of title:	13th International Conference, AAIM 2019, Beijing, China, August 6–8, 2019, Proceedings /
other author:	Du, Ding-Zhu.
Description:	IX, 354 p. 67 illus., 9 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computer science—Mathematics. -
Online resource:	https://doi.org/10.1007/978-3-030-27195-4
ISBN:	9783030271954

Algorithmic Aspects in Information and Management = 13th International Conference, AAIM 2019, Beijing, China, August 6–8, 2019, Proceedings /
Algorithmic Aspects in Information and Management13th International Conference, AAIM 2019, Beijing, China, August 6–8, 2019, Proceedings /[electronic resource] :edited by Ding-Zhu Du, Lian Li, Xiaoming Sun, Jialin Zhang. - 1st ed. 2019. - IX, 354 p. 67 illus., 9 illus. in color.online resource. - Theoretical Computer Science and General Issues ;11640. - Theoretical Computer Science and General Issues ;9163.

One-Dimensional r -Gathering under Uncertainty -- Improved Algorithms for Ranking and Unranking (k,m)-Ary Trees -- A Probabilistic Algorithm for Veriﬁcation of Geometric Theorems -- Approximating Closest Vector Problem in inﬁnte Norm Revisited -- Low-Dimensional Vectors with Density Bounded by 5/6 are Pinwheel Schedulable -- Constant-Factor Greedy Algorithms for the Asymmetric p -Center Problem in Parameterized Complete Digraphs -- Updating Matrix Polynomials -- On the Structure of Discrete Metric Spaces Isometric to Circles -- A 2.57-Approximation Algorithm for Contig-based Genomic Scaﬀold Filling -- Proﬁt Parameterizations of Dominating Set -- Exponential Time Approximation Scheme for TSP -- Interaction-aware Inﬂuence Maximization and Iterated Sandwich Method -- An approximation algorithm of the edge metric dimension problem -- The Seeding Algorithm for Spherical k-Means Clustering with Penalties -- Approximation algorithm for the correlation clustering problem with non-uniform hard constrained cluster sizes -- Two-Way Currency Trading Algorithms in the Discrete Setting -- Approximation Algorithms for the Minimum Power Partial Cover Problem -- On approximations for constructing required subgraphs using stock pieces of ﬁxed length -- A primal dual approximation algorithm for the multicut problem in trees with submodular penalties -- Algorithm aspect on the Minimum (Weighted) Doubly Resolving Set Problem of Graphs -- Trajectory Optimization of UAV for Eﬃcient Data Collection from Wireless Sensor Networks -- Locality Sensitive Algotrithms for Data Mule Routing Problem -- Maximize a Monotone Function with a Generic Submodularity Ratio -- Approximation Algorithm for Stochastic Prize-Collecting Steiner Tree Problem -- A general framework for path convexities -- An approximation algorithm for the dynamic k-level facility location problem -- Weighted Two-Dimensional Finite Automata -- Improved Parameterized Algorithms for Mixed Domination -- New Results on the Zero-Visibility Cops and Robber Game -- A two-stage constrained submodular maximization -- Local search approximation algorithms for the spherical k-means problem.

This volume constitutes the proceedings of the 13th International Conference on Algorithmic Aspects in Information and Management, AAIM 2019, held in Bejing, China in August 2019. The 31 full papers presented were carefully reviewed and selected. The papers deal with most aspects of theoretical computer science and their applications. Special considerations are given to algorithmic research that is motivated by real-world applications. .

ISBN: 9783030271954

Standard No.: 10.1007/978-3-030-27195-4doiSubjects--Topical Terms:

1253519
Computer science—Mathematics.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Algorithmic Aspects in Information and Management = 13th International Conference, AAIM 2019, Beijing, China, August 6–8, 2019, Proceedings /
LDR:04161nam a22004215i 4500 001 1014822
003 DE-He213
005 20200706141016.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030271954 $9 978-3-030-27195-4
024 7 $a 10.1007/978-3-030-27195-4 $2 doi
035 $a 978-3-030-27195-4
050 4 $a QA76.9.M35
072 7 $a PBD $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a PBD $2 thema
072 7 $a UYAM $2 thema
082 0 4 $a 004.0151 $2 23
245 1 0 $a Algorithmic Aspects in Information and Management $h [electronic resource] : $b 13th International Conference, AAIM 2019, Beijing, China, August 6–8, 2019, Proceedings / $c edited by Ding-Zhu Du, Lian Li, Xiaoming Sun, Jialin Zhang.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a IX, 354 p. 67 illus., 9 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 11640
505 0 $a One-Dimensional r -Gathering under Uncertainty -- Improved Algorithms for Ranking and Unranking (k,m)-Ary Trees -- A Probabilistic Algorithm for Veriﬁcation of Geometric Theorems -- Approximating Closest Vector Problem in inﬁnte Norm Revisited -- Low-Dimensional Vectors with Density Bounded by 5/6 are Pinwheel Schedulable -- Constant-Factor Greedy Algorithms for the Asymmetric p -Center Problem in Parameterized Complete Digraphs -- Updating Matrix Polynomials -- On the Structure of Discrete Metric Spaces Isometric to Circles -- A 2.57-Approximation Algorithm for Contig-based Genomic Scaﬀold Filling -- Proﬁt Parameterizations of Dominating Set -- Exponential Time Approximation Scheme for TSP -- Interaction-aware Inﬂuence Maximization and Iterated Sandwich Method -- An approximation algorithm of the edge metric dimension problem -- The Seeding Algorithm for Spherical k-Means Clustering with Penalties -- Approximation algorithm for the correlation clustering problem with non-uniform hard constrained cluster sizes -- Two-Way Currency Trading Algorithms in the Discrete Setting -- Approximation Algorithms for the Minimum Power Partial Cover Problem -- On approximations for constructing required subgraphs using stock pieces of ﬁxed length -- A primal dual approximation algorithm for the multicut problem in trees with submodular penalties -- Algorithm aspect on the Minimum (Weighted) Doubly Resolving Set Problem of Graphs -- Trajectory Optimization of UAV for Eﬃcient Data Collection from Wireless Sensor Networks -- Locality Sensitive Algotrithms for Data Mule Routing Problem -- Maximize a Monotone Function with a Generic Submodularity Ratio -- Approximation Algorithm for Stochastic Prize-Collecting Steiner Tree Problem -- A general framework for path convexities -- An approximation algorithm for the dynamic k-level facility location problem -- Weighted Two-Dimensional Finite Automata -- Improved Parameterized Algorithms for Mixed Domination -- New Results on the Zero-Visibility Cops and Robber Game -- A two-stage constrained submodular maximization -- Local search approximation algorithms for the spherical k-means problem.
520 $a This volume constitutes the proceedings of the 13th International Conference on Algorithmic Aspects in Information and Management, AAIM 2019, held in Bejing, China in August 2019. The 31 full papers presented were carefully reviewed and selected. The papers deal with most aspects of theoretical computer science and their applications. Special considerations are given to algorithmic research that is motivated by real-world applications. .
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Numerical analysis. $3 527939
650 0 $a Algorithms. $3 527865
650 0 $a Data structures (Computer science). $3 680370
650 1 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Numeric Computing. $3 669943
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Data Structures. $3 669824
700 1 $a Du, Ding-Zhu. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 670906
700 1 $a Li, Lian. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1112362
700 1 $a Sun, Xiaoming. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1206998
700 1 $a Zhang, Jialin. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1308962
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030271947
776 0 8 $i Printed edition: $z 9783030271961
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-27195-4
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)