Algorithmic Aspects in Information and Management

18th International Conference, AAIM 2024, Virtual Event, September 21-23, 2024, Proceedings, Part II
2024
ISBN: 978-981-97-7800-3
Verlag: Springer Nature Singapore

Buch, Englisch, Band 15180, 268 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 435 g

Reihe: Lecture Notes in Computer Science

This two-volume set LNCS 15179-15180 constitutes the refereed proceedings of the 18th International Conference on Algorithmic Aspects in Information and Management, AAIM 2024, which took place virtually during September 21-23, 2024.
The 45 full papers  presented in these two volumes were carefully reviewed and selected from 76 submissions. The papers are organized in the following topical sections:
Part I: Optimization and applications; submodularity, management and others,
Part II: Graphs and networks; quantum and others.

Zielgruppe

Research

Autoren/Hrsg.

Zhang, Zhao

Ghosh, Smita

Fachgebiete

• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz
• Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Informationstheorie, Kodierungstheorie
• Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik

Inhaltsverzeichnis

.- Graphs and Networks.

.- Detection and Analysis of Cryptocurrency Scams on Twitter.

.- Representation of Dominating Set Variants using Dataless Neural Networks.

.- Algorithms for the Constrained Assignment Problems with Bounds and Maximum Penalty.

.- Enabling Proactive Microservice Placement in Collaborative Edge Computing Network.

.- Speeding Up Constrained $k$-Means Through 2-Means.

.- Stable Matching with Approval Preferences under Partial Information.

.- A polynomial time algorithm to find star chromatic index on bounded treewidth graphs with given maximum degree.

.- On the Kalai-Smorodinsky solutions for Bi-objective Spanning Tree Problem.

.- Improved approximation algorithms for Patrol-Scheduling with Min-Max Latency using Multiclass Minimum Spanning Forests.

.- Time-Sensitive Target Coverage Under Visibility Constraints with UAVs.

.- Online bottleneck matching on a star.

.- Quantum Annealing and GNN for Solving TSP with QUBO.

.- Task Planning for The Multi-center Heterogeneous Vehicle Pickup and Delivery Problem.

.- Plane Segmentation for Proportional Division of Resources.

.- Fair Division with Weighted and Prioritized Agents.

.- The Characterizations and Complexity of Roman {2}-Domination and 2-
Domination in Graphs.

.- Quantum and Others.

.- Quantum Lung Segmentation: QCU-Net Applied to Chest X-ray Images.

.- On the Existence of Parameterized Algorithms for the Shortest Common Supersequence and Related Problems.

.- Algorithmic Construction of Tessellation Cover to QUBO Formulations.

.- Finding Fair and Efficient Allocations of Indivisible Chores.

.- An Algebraic Perspective on Tree Imbalance Metrics.

.- Towards understanding news plagiarism: theoretical and experimental analysis.