國立虎尾科技大學 |

Algorithmic Aspects in Information and Management = 16th International Conference, AAIM 2022, Guangzhou, China, August 13–14, 2022, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Algorithmic Aspects in Information and Management/ edited by Qiufen Ni, Weili Wu.
其他題名:	16th International Conference, AAIM 2022, Guangzhou, China, August 13–14, 2022, Proceedings /
其他作者:	Wu, Weili.
面頁冊數:	XIV, 478 p. 101 illus., 46 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Theory of Computation. -
電子資源:	https://doi.org/10.1007/978-3-031-16081-3
ISBN:	9783031160813

Algorithmic Aspects in Information and Management = 16th International Conference, AAIM 2022, Guangzhou, China, August 13–14, 2022, Proceedings /
Algorithmic Aspects in Information and Management16th International Conference, AAIM 2022, Guangzhou, China, August 13–14, 2022, Proceedings /[electronic resource] :edited by Qiufen Ni, Weili Wu. - 1st ed. 2022. - XIV, 478 p. 101 illus., 46 illus. in color.online resource. - Lecture Notes in Computer Science,135131611-3349 ;. - Lecture Notes in Computer Science,9324.

An improvement of the bound on the odd chromatic number of 1-planar graphs -- AoI Minimizing of Wireless Rechargeable Sensor Network based on Trajectory Optimization of Laser-Charged UAV -- Monotone k-Submodular Knapsack Maximization: An Analysis of the Greedy+Singleton Algorithm -- The constrained parallel-machine scheduling problem with divisible processing times and penalties -- Energy-constrained Geometric Covering Problem -- Fast searching on $k$-combinable graphs -- Three Algorithms for Converting Control Flow Statements from Python to XD-M -- Class Ramsey numbers involving induced graphs -- An Approximation Algorithm for the Clustered Path Travelling Salesman Problem -- Hyperspectral Image Reconstruction for SD-CASSI systems based on Residual Attention Network -- Improved Approximation Algorithm for the Asymmetric Prize-Collecting TSP -- Injective edge coloring of power graphs and necklaces -- Guarantees for Maximization of $k$-Submodular Functions with a Knapsack and a Matroid Constraint -- Incremental SDN Deployment to Achieve Load Balance in ISP Networks -- Approximation scheme for single-machine rescheduling with job delay and rejection -- Defense of Scapegoating Attack in Network Tomography -- A Binary Search Double Greedy Algorithm for Non-monotone DR-submodular Maximization -- Streaming Adaptive Submodular Maximization -- Constrained Stochastic Submodular Maximization with State-Dependent Costs -- Online early work maximization problem on two hierarchical machines with buffer or rearrangements -- Polynomial time algorithm for k-vertex-edge dominating problem in interval graphs -- Adaptive Competition-based Diversified-profit Maximization with Online Seed Allocation -- Collaborative Service Caching in Mobile Edge Nodes -- A Decentralized Auction Framework with Privacy Protection in Mobile Crowdsourcing -- On-line single machine scheduling with release dates and submodular rejection penalties -- Obnoxious Facility Location Games with Candidate Locations -- Profit Maximization for Multiple Products in Community-based Social Networks -- MCM: A Robust Map Matching Method by Tracking Multiple Road Candidates -- Security on Ethereum: Ponzi Scheme Detection in Smart Contract -- Cyclically orderable generalized Petersen graphs -- The r-dynamic chromatic number of planar graphs without special short cycles -- Distance Labeling of the Halved Folded $n$-Cube -- Signed network embedding based on muti-attention mechanism -- Balanced Graph Partitioning based on Mixed 0-1 Linear Programming and Iteration Vertex Relocation Algorithm -- Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance -- Mixed Metric Dimension of Some Plane Graphs -- The Optimal Dynamic Rationing Policy in the Stock-Rationing Queue -- Pilot Pattern Design with Branch and Bound in PSA-OFDM System -- Bicriteria Algorithms for Maximizing the Difference Between Submodular Function and Linear Function under Noise -- On the Transversal Number of k-Uniform Connected Hypergraphs -- Total coloring of planar graphs without some adjacent cycles.

This book constitutes the proceedings of the 16th International Conference on Algorithmic Aspects in Information and Management, AAIM 2022, which was held online during August 13-14, 2022. The conference was originally planned to take place in Guangzhou, China, but changed to a virtual event due to the COVID-19 pandemic. The 41 regular papers included in this book were carefully reviewed and selected from 59 submissions. .

ISBN: 9783031160813

Standard No.: 10.1007/978-3-031-16081-3doiSubjects--Topical Terms:

669322
Theory of Computation.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Algorithmic Aspects in Information and Management = 16th International Conference, AAIM 2022, Guangzhou, China, August 13–14, 2022, Proceedings /
LDR:05103nam a22004455i 4500 001 1083254
003 DE-He213
005 20220917230741.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783031160813 $9 978-3-031-16081-3
024 7 $a 10.1007/978-3-031-16081-3 $2 doi
035 $a 978-3-031-16081-3
050 4 $a QA76.9.M35
050 4 $a QA297.4
072 7 $a UYAM $2 bicssc
072 7 $a PBD $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a UYAM $2 thema
072 7 $a PBD $2 thema
082 0 4 $a 004.0151 $2 23
245 1 0 $a Algorithmic Aspects in Information and Management $h [electronic resource] : $b 16th International Conference, AAIM 2022, Guangzhou, China, August 13–14, 2022, Proceedings / $c edited by Qiufen Ni, Weili Wu.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XIV, 478 p. 101 illus., 46 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 Lecture Notes in Computer Science, $x 1611-3349 ; $v 13513
505 0 $a An improvement of the bound on the odd chromatic number of 1-planar graphs -- AoI Minimizing of Wireless Rechargeable Sensor Network based on Trajectory Optimization of Laser-Charged UAV -- Monotone k-Submodular Knapsack Maximization: An Analysis of the Greedy+Singleton Algorithm -- The constrained parallel-machine scheduling problem with divisible processing times and penalties -- Energy-constrained Geometric Covering Problem -- Fast searching on $k$-combinable graphs -- Three Algorithms for Converting Control Flow Statements from Python to XD-M -- Class Ramsey numbers involving induced graphs -- An Approximation Algorithm for the Clustered Path Travelling Salesman Problem -- Hyperspectral Image Reconstruction for SD-CASSI systems based on Residual Attention Network -- Improved Approximation Algorithm for the Asymmetric Prize-Collecting TSP -- Injective edge coloring of power graphs and necklaces -- Guarantees for Maximization of $k$-Submodular Functions with a Knapsack and a Matroid Constraint -- Incremental SDN Deployment to Achieve Load Balance in ISP Networks -- Approximation scheme for single-machine rescheduling with job delay and rejection -- Defense of Scapegoating Attack in Network Tomography -- A Binary Search Double Greedy Algorithm for Non-monotone DR-submodular Maximization -- Streaming Adaptive Submodular Maximization -- Constrained Stochastic Submodular Maximization with State-Dependent Costs -- Online early work maximization problem on two hierarchical machines with buffer or rearrangements -- Polynomial time algorithm for k-vertex-edge dominating problem in interval graphs -- Adaptive Competition-based Diversified-profit Maximization with Online Seed Allocation -- Collaborative Service Caching in Mobile Edge Nodes -- A Decentralized Auction Framework with Privacy Protection in Mobile Crowdsourcing -- On-line single machine scheduling with release dates and submodular rejection penalties -- Obnoxious Facility Location Games with Candidate Locations -- Profit Maximization for Multiple Products in Community-based Social Networks -- MCM: A Robust Map Matching Method by Tracking Multiple Road Candidates -- Security on Ethereum: Ponzi Scheme Detection in Smart Contract -- Cyclically orderable generalized Petersen graphs -- The r-dynamic chromatic number of planar graphs without special short cycles -- Distance Labeling of the Halved Folded $n$-Cube -- Signed network embedding based on muti-attention mechanism -- Balanced Graph Partitioning based on Mixed 0-1 Linear Programming and Iteration Vertex Relocation Algorithm -- Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance -- Mixed Metric Dimension of Some Plane Graphs -- The Optimal Dynamic Rationing Policy in the Stock-Rationing Queue -- Pilot Pattern Design with Branch and Bound in PSA-OFDM System -- Bicriteria Algorithms for Maximizing the Difference Between Submodular Function and Linear Function under Noise -- On the Transversal Number of k-Uniform Connected Hypergraphs -- Total coloring of planar graphs without some adjacent cycles.
520 $a This book constitutes the proceedings of the 16th International Conference on Algorithmic Aspects in Information and Management, AAIM 2022, which was held online during August 13-14, 2022. The conference was originally planned to take place in Guangzhou, China, but changed to a virtual event due to the COVID-19 pandemic. The 41 regular papers included in this book were carefully reviewed and selected from 59 submissions. .
650 2 4 $a Theory of Computation. $3 669322
650 2 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 1 4 $a Discrete Mathematics in Computer Science. $3 670123
650 0 $a Computer science. $3 573171
650 0 $a Artificial intelligence. $3 559380
650 0 $a Information theory. $3 595305
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Discrete mathematics. $3 1254302
650 0 $a Computer science—Mathematics. $3 1253519
700 1 $a Wu, Weili. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 678792
700 1 $a Ni, Qiufen. $e editor. $1 https://orcid.org/0000-0002-0462-9549 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1389179
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783031160806
776 0 8 $i Printed edition: $z 9783031160820
830 0 $a Lecture Notes in Computer Science, $x 0302-9743 ; $v 9324 $3 1258960
856 4 0 $u https://doi.org/10.1007/978-3-031-16081-3
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)