東華大學圖書館 |

Algorithmic aspects in information and management = 15th International Conference, AAIM 2021, virtual event, December 20-22, 2021 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Algorithmic aspects in information and management/ edited by Weili Wu, Hongwei Du.
其他題名:	15th International Conference, AAIM 2021, virtual event, December 20-22, 2021 : proceedings /
其他題名:	AAIM 2021
其他作者:	Wu, Weili.
團體作者:	International Conference on Algorithmic Aspects in Information and Management
出版者:	Cham :Springer International Publishing : : 2021.,
面頁冊數:	xii, 452 p. :ill., digital ;24 cm.
內容註:	Approximation Algorithms -- Constant-Approximation for Prize-Collecting Min-Sensor Sweep Coverage with Base Stations -- Approximation Algorithm for the Capacitated Correlation Clustering Problem with Penalties -- Approximation algorithms for the maximum bounded connected bipartition problem -- An Approximation Algorithm for Solving the Heterogeneous Chinese Postman Problem -- On Stochastic k-Facility Location -- The Complexity of Finding a Broadcast Center -- An Online Algorithm for Data Caching Problem in Edge Computing -- Topical part: Scheduling -- Scheduling on Multiple Two-Stage Flowshops with A Deadline -- Single machine scheduling with rejection to minimize the weighted makespan -- Maximizing Energy Efficiency for Charger Scheduling of WRSNs -- A New Branch-and-Price Algorithm for Daily Aircraft Routing and Scheduling Problem -- Optimizing mobile charger scheduling for task-based sensor networks -- Semi-online early work maximization problem on two hierarchical machines with partial information of processing time -- Topical part: Nonlinear Combinatorial Optimization -- Streaming Algorithms for Maximizing DR-submodular Functions with d-Knapsack Constraints -- Stochastic Submodular Probing with State-Dependent Costs -- Bi-criteria Adaptive Algorithms for Supermodular Minimization -- Improved Algorithms for Non-submodular Function Maximization Problem -- Fixed Observation Time-step: Adaptive Influence Maximization -- Measured Continuous Greedy with Differential Privacy -- Topical part: Network Problems -- Robust t-Path Topology Control Algorithm in Wireless Ad Hoc Networks -- Multi-attribute based Influence Maximization in Social Networks -- A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks -- A Fast FPTAS for Two Dimensional Barrier Coverage Using Sink-Based Mobile Sensors with Min-Sum Movement -- Time Sensitive Sweep Coverage with Multiple UAVs -- Recursive Merged Community Detection Algorithm based on Node Cluster -- Purchase Preferences - Based Air Passenger Choice Behavior Analysis from Sales Transaction Data -- Topical part: Blockchain, Logic, Complexity and Reliability -- Multi-Window Bitcoin Price Prediction Framework on Blockchain Transaction Graph -- Sensitivity-Based Optimization for Blockchain Selfish Mining -- Design and Implementation of List and Dictionary in XD-M Language -- Reliable Edge Intelligence using JPEG Progressive -- A game-theoretic analysis of deep neural networks -- Energy Complexity of Satisfying Assignments in Monotone Circuits: On the Complexity of Computing the Best Case -- Topical part: Miscellaneous -- The independence numbers of weighted graphs with forbidden cycles -- Wegner's Conjecture on 2-Distance Coloring -- An Efficient Oracle for Counting Shortest Paths in Planar Graphs -- Restrained and total restrained domination in cographs -- An order Approach for the Core Maintenance Problem on Edge-weighted Graphs -- Fixed-parameter Tractability for Book Drawing with Bounded Number of Crossings Per Edge.
Contained By:	Springer Nature eBook
標題:	Computer algorithms - Congresses. -
電子資源:	https://doi.org/10.1007/978-3-030-93176-6
ISBN:	9783030931766

Algorithmic aspects in information and management = 15th International Conference, AAIM 2021, virtual event, December 20-22, 2021 : proceedings /
Algorithmic aspects in information and management15th International Conference, AAIM 2021, virtual event, December 20-22, 2021 : proceedings /[electronic resource] :AAIM 2021edited by Weili Wu, Hongwei Du. - Cham :Springer International Publishing :2021. - xii, 452 p. :ill., digital ;24 cm. - Lecture notes in computer science,131530302-9743 ;. - Lecture notes in computer science ;13153..

Approximation Algorithms -- Constant-Approximation for Prize-Collecting Min-Sensor Sweep Coverage with Base Stations -- Approximation Algorithm for the Capacitated Correlation Clustering Problem with Penalties -- Approximation algorithms for the maximum bounded connected bipartition problem -- An Approximation Algorithm for Solving the Heterogeneous Chinese Postman Problem -- On Stochastic k-Facility Location -- The Complexity of Finding a Broadcast Center -- An Online Algorithm for Data Caching Problem in Edge Computing -- Topical part: Scheduling -- Scheduling on Multiple Two-Stage Flowshops with A Deadline -- Single machine scheduling with rejection to minimize the weighted makespan -- Maximizing Energy Efficiency for Charger Scheduling of WRSNs -- A New Branch-and-Price Algorithm for Daily Aircraft Routing and Scheduling Problem -- Optimizing mobile charger scheduling for task-based sensor networks -- Semi-online early work maximization problem on two hierarchical machines with partial information of processing time -- Topical part: Nonlinear Combinatorial Optimization -- Streaming Algorithms for Maximizing DR-submodular Functions with d-Knapsack Constraints -- Stochastic Submodular Probing with State-Dependent Costs -- Bi-criteria Adaptive Algorithms for Supermodular Minimization -- Improved Algorithms for Non-submodular Function Maximization Problem -- Fixed Observation Time-step: Adaptive Influence Maximization -- Measured Continuous Greedy with Differential Privacy -- Topical part: Network Problems -- Robust t-Path Topology Control Algorithm in Wireless Ad Hoc Networks -- Multi-attribute based Influence Maximization in Social Networks -- A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks -- A Fast FPTAS for Two Dimensional Barrier Coverage Using Sink-Based Mobile Sensors with Min-Sum Movement -- Time Sensitive Sweep Coverage with Multiple UAVs -- Recursive Merged Community Detection Algorithm based on Node Cluster -- Purchase Preferences - Based Air Passenger Choice Behavior Analysis from Sales Transaction Data -- Topical part: Blockchain, Logic, Complexity and Reliability -- Multi-Window Bitcoin Price Prediction Framework on Blockchain Transaction Graph -- Sensitivity-Based Optimization for Blockchain Selfish Mining -- Design and Implementation of List and Dictionary in XD-M Language -- Reliable Edge Intelligence using JPEG Progressive -- A game-theoretic analysis of deep neural networks -- Energy Complexity of Satisfying Assignments in Monotone Circuits: On the Complexity of Computing the Best Case -- Topical part: Miscellaneous -- The independence numbers of weighted graphs with forbidden cycles -- Wegner's Conjecture on 2-Distance Coloring -- An Efficient Oracle for Counting Shortest Paths in Planar Graphs -- Restrained and total restrained domination in cographs -- An order Approach for the Core Maintenance Problem on Edge-weighted Graphs -- Fixed-parameter Tractability for Book Drawing with Bounded Number of Crossings Per Edge.

This book constitutes the proceedings of the 15th International Conference on Algorithmic Aspects in Information and Management, AAIM 2021, which was held online during December 20-22, 2021. The conference was originally planned to take place in Dallas, Texas, USA, but changed to a virtual event due to the COVID-19 pandemic. The 38 regular papers included in this book were carefully reviewed and selected from 62 submissions. They were organized in the following topical sections: approximation algorithms; scheduling; nonlinear combinatorial optimization; network problems; blockchain, logic, complexity and reliability; and miscellaneous.

ISBN: 9783030931766

Standard No.: 10.1007/978-3-030-93176-6doiSubjects--Topical Terms:

576357
Computer algorithms
--Congresses.

LC Class. No.: QA76.9.A43 / I57 2021

Dewey Class. No.: 005.1

Algorithmic aspects in information and management = 15th International Conference, AAIM 2021, virtual event, December 20-22, 2021 : proceedings /
LDR:04952nmm a2200373 a 4500 001 2262008
003 DE-He213
005 20211216215120.0
006 m d
007 cr nn 008maaau
008 220616s2021 sz s 0 eng d
020 $a 9783030931766 $q (electronic bk.)
020 $a 9783030931759 $q (paper)
024 7 $a 10.1007/978-3-030-93176-6 $2 doi
035 $a 978-3-030-93176-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43 $b I57 2021
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 I61 2021
111 2 $a International Conference on Algorithmic Aspects in Information and Management $n (15th : $d 2021 : $c Online) $3 3537943
245 1 0 $a Algorithmic aspects in information and management $h [electronic resource] : $b 15th International Conference, AAIM 2021, virtual event, December 20-22, 2021 : proceedings / $c edited by Weili Wu, Hongwei Du.
246 3 $a AAIM 2021
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xii, 452 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 13153
490 1 $a Theoretical computer science and general issues
505 0 $a Approximation Algorithms -- Constant-Approximation for Prize-Collecting Min-Sensor Sweep Coverage with Base Stations -- Approximation Algorithm for the Capacitated Correlation Clustering Problem with Penalties -- Approximation algorithms for the maximum bounded connected bipartition problem -- An Approximation Algorithm for Solving the Heterogeneous Chinese Postman Problem -- On Stochastic k-Facility Location -- The Complexity of Finding a Broadcast Center -- An Online Algorithm for Data Caching Problem in Edge Computing -- Topical part: Scheduling -- Scheduling on Multiple Two-Stage Flowshops with A Deadline -- Single machine scheduling with rejection to minimize the weighted makespan -- Maximizing Energy Efficiency for Charger Scheduling of WRSNs -- A New Branch-and-Price Algorithm for Daily Aircraft Routing and Scheduling Problem -- Optimizing mobile charger scheduling for task-based sensor networks -- Semi-online early work maximization problem on two hierarchical machines with partial information of processing time -- Topical part: Nonlinear Combinatorial Optimization -- Streaming Algorithms for Maximizing DR-submodular Functions with d-Knapsack Constraints -- Stochastic Submodular Probing with State-Dependent Costs -- Bi-criteria Adaptive Algorithms for Supermodular Minimization -- Improved Algorithms for Non-submodular Function Maximization Problem -- Fixed Observation Time-step: Adaptive Influence Maximization -- Measured Continuous Greedy with Differential Privacy -- Topical part: Network Problems -- Robust t-Path Topology Control Algorithm in Wireless Ad Hoc Networks -- Multi-attribute based Influence Maximization in Social Networks -- A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks -- A Fast FPTAS for Two Dimensional Barrier Coverage Using Sink-Based Mobile Sensors with Min-Sum Movement -- Time Sensitive Sweep Coverage with Multiple UAVs -- Recursive Merged Community Detection Algorithm based on Node Cluster -- Purchase Preferences - Based Air Passenger Choice Behavior Analysis from Sales Transaction Data -- Topical part: Blockchain, Logic, Complexity and Reliability -- Multi-Window Bitcoin Price Prediction Framework on Blockchain Transaction Graph -- Sensitivity-Based Optimization for Blockchain Selfish Mining -- Design and Implementation of List and Dictionary in XD-M Language -- Reliable Edge Intelligence using JPEG Progressive -- A game-theoretic analysis of deep neural networks -- Energy Complexity of Satisfying Assignments in Monotone Circuits: On the Complexity of Computing the Best Case -- Topical part: Miscellaneous -- The independence numbers of weighted graphs with forbidden cycles -- Wegner's Conjecture on 2-Distance Coloring -- An Efficient Oracle for Counting Shortest Paths in Planar Graphs -- Restrained and total restrained domination in cographs -- An order Approach for the Core Maintenance Problem on Edge-weighted Graphs -- Fixed-parameter Tractability for Book Drawing with Bounded Number of Crossings Per Edge.
520 $a This book constitutes the proceedings of the 15th International Conference on Algorithmic Aspects in Information and Management, AAIM 2021, which was held online during December 20-22, 2021. The conference was originally planned to take place in Dallas, Texas, USA, but changed to a virtual event due to the COVID-19 pandemic. The 38 regular papers included in this book were carefully reviewed and selected from 62 submissions. They were organized in the following topical sections: approximation algorithms; scheduling; nonlinear combinatorial optimization; network problems; blockchain, logic, complexity and reliability; and miscellaneous.
650 0 $a Computer algorithms $x Congresses. $3 576357
650 0 $a Management science $x Data processing $v Congresses. $3 1073837
650 1 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Theory of Computation. $3 892514
650 2 4 $a Computer Imaging, Vision, Pattern Recognition and Graphics. $3 890871
650 2 4 $a Data Structures. $3 891009
650 2 4 $a Numeric Computing. $3 892606
700 1 $a Wu, Weili. $3 748571
700 1 $a Du, Hongwei. $3 3409621
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 13153. $3 3537944
830 0 $a Theoretical computer science and general issues. $3 3382501
856 4 0 $u https://doi.org/10.1007/978-3-030-93176-6
950 $a Computer Science (SpringerNature-11645)