國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Algorithmic aspects in information a...

(1998 :)

Algorithmic aspects in information and management13th International Conference, AAIM 2019, Beijing, China, August 6-8, 2019 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Algorithmic aspects in information and managementedited by Ding-Zhu Du ... [et al.].
其他題名:	13th International Conference, AAIM 2019, Beijing, China, August 6-8, 2019 : proceedings /
其他題名:	AAIM 2019
其他作者:	Du, Ding-Zhu.
團體作者:
出版者:	Cham :Springer International Publishing :2019.
面頁冊數:	ix, 354 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer eBooks
標題:	Computer algorithmsCongresses.
電子資源:	https://doi.org/10.1007/978-3-030-27195-4
ISBN:	9783030271954$q(electronic bk.)

Algorithmic aspects in information and management13th 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] :AAIM 2019edited by Ding-Zhu Du ... [et al.]. - Cham :Springer International Publishing :2019. - ix, 354 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,116400302-9743 ;. - Lecture notes in computer science ;4891..

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$q(electronic bk.)

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

380777
Computer algorithms
--Congresses.

LC Class. No.: QA76.9.A43 / A35 2019

Dewey Class. No.: 005.1

Algorithmic aspects in information and management13th International Conference, AAIM 2019, Beijing, China, August 6-8, 2019 : proceedings /
LDR:03873nmm a2200373 a 4500 001 563732
003 DE-He213
005 20190801102439.0
006 m d
007 cr nn 008maaau
008 200311s2019 gw s 0 eng d
020 $a 9783030271954$q(electronic bk.)
020 $a 9783030271947$q(paper)
024 7 $a 10.1007/978-3-030-27195-4 $2 doi
035 $a 978-3-030-27195-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43 $b A35 2019
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 005.1 $2 23
090 $a QA76.9.A43 $b A111 2019
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
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 ... [et al.].
246 3 $a AAIM 2019
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a ix, 354 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 11640
490 1 $a Theoretical computer science and general issues
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 algorithms $v Congresses. $3 380777
650 0 $a Management science $x Data processing $v Congresses. $3 470365
650 1 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Numeric Computing. $3 275524
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Data Structures. $3 273992
700 1 $a Du, Ding-Zhu. $3 253890
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Theoretical computer science and general issues. $3 822018
856 4 0 $u https://doi.org/10.1007/978-3-030-27195-4
950 $a Computer Science (Springer-11645)