Muutke küpsiste eelistusi

Algorithmic Aspects in Information and Management: 16th International Conference, AAIM 2022, Guangzhou, China, August 1314, 2022, Proceedings 1st ed. 2022 [Pehme köide]

Edited by , Edited by
  • Formaat: Paperback / softback, 478 pages, kõrgus x laius: 235x155 mm, kaal: 747 g, 46 Illustrations, color; 55 Illustrations, black and white; XIV, 478 p. 101 illus., 46 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 13513
  • Ilmumisaeg: 18-Sep-2022
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031160800
  • ISBN-13: 9783031160806
  • Pehme köide
  • Hind: 48,70 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 57,29 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Paperback / softback, 478 pages, kõrgus x laius: 235x155 mm, kaal: 747 g, 46 Illustrations, color; 55 Illustrations, black and white; XIV, 478 p. 101 illus., 46 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 13513
  • Ilmumisaeg: 18-Sep-2022
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031160800
  • ISBN-13: 9783031160806
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. 

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.