001449672 000__ 05808cam\a2200541\i\4500
001449672 001__ 1449672
001449672 003__ OCoLC
001449672 005__ 20230310004412.0
001449672 006__ m\\\\\o\\d\\\\\\\\
001449672 007__ cr\un\nnnunnun
001449672 008__ 220921s2022\\\\sz\a\\\\o\\\\\101\0\eng\d
001449672 020__ $$a9783031160813$$q(electronic bk.)
001449672 020__ $$a3031160819$$q(electronic bk.)
001449672 020__ $$z9783031160806$$q(print)
001449672 0247_ $$a10.1007/978-3-031-16081-3$$2doi
001449672 035__ $$aSP(OCoLC)1345279779
001449672 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dEBLCP$$dOCLCF$$dOCLCQ
001449672 049__ $$aISEA
001449672 050_4 $$aQA76.9.A43
001449672 08204 $$a005.1$$223/eng/20220921
001449672 1112_ $$aInternational Conference on Algorithmic Aspects in Information and Management$$n(16th :$$d2022 :$$cOnline)
001449672 24510 $$aAlgorithmic aspects in information and management :$$b16th International Conference, AAIM 2022, Guangzhou, China, August 13-14, 2022, Proceedings /$$cQiufen Ni, Weili Wu (eds.).
001449672 2463_ $$aAAIM 2022
001449672 264_1 $$aCham, Switzerland :$$bSpringer,$$c2022.
001449672 300__ $$a1 online resource (xiv, 478 pages) :$$billustrations (some color).
001449672 336__ $$atext$$btxt$$2rdacontent
001449672 337__ $$acomputer$$bc$$2rdamedia
001449672 338__ $$aonline resource$$bcr$$2rdacarrier
001449672 4901_ $$aLecture notes in computer science,$$x1611-3349 ;$$v13513
001449672 500__ $$a"The conference was held virtually due to the COVID-19 pandemic."
001449672 500__ $$aIncludes author index.
001449672 5050_ $$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.
001449672 506__ $$aAccess limited to authorized users.
001449672 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.
001449672 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed September 21, 2022).
001449672 650_0 $$aComputer algorithms$$vCongresses.
001449672 650_0 $$aManagement science$$xData processing$$vCongresses.
001449672 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001449672 655_0 $$aElectronic books.
001449672 7001_ $$aNi, Qiufen,$$eeditor.$$0(orcid)0000-0002-0462-9549$$1https://orcid.org/0000-0002-0462-9549
001449672 7001_ $$aWu, Weili,$$eeditor.$$1https://orcid.org/0000-0001-8747-6340
001449672 830_0 $$aLecture notes in computer science ;$$v13513.$$x1611-3349
001449672 852__ $$bebk
001449672 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-031-16081-3$$zOnline Access$$91397441.1
001449672 909CO $$ooai:library.usi.edu:1449672$$pGLOBAL_SET
001449672 980__ $$aBIB
001449672 980__ $$aEBOOK
001449672 982__ $$aEbook
001449672 983__ $$aOnline
001449672 994__ $$a92$$bISE