000 05963nam a22006375i 4500
001 978-3-031-16081-3
003 DE-He213
005 20240730165646.0
007 cr nn 008mamaa
008 220917s2022 sz | s |||| 0|eng d
020 _a9783031160813
_9978-3-031-16081-3
024 7 _a10.1007/978-3-031-16081-3
_2doi
050 4 _aQA76.9.M35
050 4 _aQA297.4
072 7 _aUYAM
_2bicssc
072 7 _aPBD
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYAM
_2thema
072 7 _aPBD
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aAlgorithmic Aspects in Information and Management
_h[electronic resource] :
_b16th International Conference, AAIM 2022, Guangzhou, China, August 13-14, 2022, Proceedings /
_cedited by Qiufen Ni, Weili Wu.
250 _a1st ed. 2022.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2022.
300 _aXIV, 478 p. 101 illus., 46 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13513
505 0 _aAn 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 _aThis 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 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aData structures (Computer science).
_98188
650 0 _aInformation theory.
_914256
650 0 _aArtificial intelligence.
_93407
650 0 _aComputer science.
_99832
650 1 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aData Structures and Information Theory.
_931923
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aTheory of Computation.
_990079
700 1 _aNi, Qiufen.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_990080
700 1 _aWu, Weili.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_990081
710 2 _aSpringerLink (Online service)
_990082
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031160806
776 0 8 _iPrinted edition:
_z9783031160820
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13513
_923263
856 4 0 _uhttps://doi.org/10.1007/978-3-031-16081-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c86459
_d86459