LEADER 06480nam 22007695 450 001 9910513582803321 005 20230515183923.0 010 $a3-030-93176-5 024 7 $a10.1007/978-3-030-93176-6 035 $a(MiAaPQ)EBC6828334 035 $a(Au-PeEL)EBL6828334 035 $a(CKB)20151376500041 035 $a(OCoLC)1290483947 035 $a(DE-He213)978-3-030-93176-6 035 $a(PPN)259385166 035 $a(EXLCZ)9920151376500041 100 $a20211216d2021 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithmic Aspects in Information and Management $e15th International Conference, AAIM 2021, Virtual Event, December 20?22, 2021, Proceedings /$fedited by Weili Wu, Hongwei Du 205 $a1st ed. 2021. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021. 215 $a1 online resource (456 pages) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v13153 311 08$aPrint version: Wu, Weili Algorithmic Aspects in Information and Management Cham : Springer International Publishing AG,c2022 9783030931759 327 $aApproximation 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. 330 $aThis 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. . 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v13153 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aComputer science 606 $aImage processing$xDigital techniques 606 $aComputer vision 606 $aData structures (Computer science) 606 $aInformation theory 606 $aNumerical analysis 606 $aDiscrete Mathematics in Computer Science 606 $aTheory of Computation 606 $aComputer Imaging, Vision, Pattern Recognition and Graphics 606 $aData Structures and Information Theory 606 $aNumerical Analysis 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aComputer science. 615 0$aImage processing$xDigital techniques. 615 0$aComputer vision. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 0$aNumerical analysis. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aTheory of Computation. 615 24$aComputer Imaging, Vision, Pattern Recognition and Graphics. 615 24$aData Structures and Information Theory. 615 24$aNumerical Analysis. 676 $a005.1 702 $aWu$b Weili 702 $aDu$b Hongwei 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910513582803321 996 $aAlgorithmic Aspects in Information and Management$9771920 997 $aUNINA