
Algorithmic Aspects in Information and Management
Description
Alles über E-Books | Antworten auf Fragen rund um E-Books, Kopierschutz und Dateiformate finden Sie in unserem Info- & Hilfebereich.
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.
More details
Other editions
Additional editions

Content
.- Optimization and Applications.
.- Maximum Core Spanning Tree Insertion Maintenance for Large Dynamic Graphs.
.- NFTO: DAG-Based Task Offloading and Energy Optimization Algorithm in Mobile Edge Computing.
.- Approximation Algorithm for the Maximum Interval Multi-Cover Problem.
.- Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network.
.- Efficient Approximation Algorithms for Parallel Batch Machine Scheduling of Malleable Jobs.
.- Cost-sharing mechanisms for the selfish open-end bin packing problem.
.- ToI-based Data Utility Maximization for UAV-assisted Wireless Sensor Networks.
.- Parity-Constrained Weighted k-Center.
.- Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters.
.- Dynamic DR-Submodular Maximization with Linear Costs over the Integer Lattice.
.- A distributed approximation algorithm for the total dominating set problem.
.- Revisit the online facility location problem with uniform facility cost.
.- or-Submodular maximization under a Matroid Constraint and a Knapsack Constraint.
.- A Distributed Method for Negative Content Spread Minimization on Social Networks.
.- Approximation Algorithms for the Minimum Weight Cycle/Path Partition Problem.
.- Iterative rounding for bag of tasks scheduling with rejection in high performance computing.
.- Optimization and Applications.
.- Integrated airline aircraft routing and crew pairing by alternating Lagrangian decomposition.
.- Monotone Submodular Meta-Learning under the Matroid Constraint.
.- Submodular Participatory Budgeting.
.- Approximation Algorithms for $k$-Submodular Maximization under the Fair Constraints and Size Constraints.
.- Systematic Review of Cybersecurity Disclosure Research.
.- Revisiting the stretch factor of Delaunay triangulations of points in convex position.
.- Transition-based Heterogeneous Network Embedding by Self-Attention Model of Sparse Matrix.
System requirements
File format: PDF
Copy protection: Watermark-DRM (Digital Rights Management)
System requirements:
- Computer (Windows; MacOS X; Linux): Use the free software Adobe Reader, Adobe Digital Editions, or any other PDF viewer of your choice (see eBook Help).
- Tablet/Smartphone (Android; iOS): Install the free app Adobe Digital Editions or another reading app for eBooks, e.g., PocketBook (see eBook Help).
- E-reader: Bookeen, Kobo, Pocketbook, Sony, Tolino and many more (only limited: Kindle).
The file format PDF always displays a book page identically on any hardware. This makes PDF suitable for complex layouts such as those used in textbooks and reference books (images, tables, columns, footnotes). Unfortunately, on the small screens of e-readers or smartphones, PDFs are rather annoying, requiring too much scrolling.
This eBook uses Watermark-DRM, a „soft” copy protection. This means that there are no technical restrictions to prevent illegal distribution. However, there is a personalised watermark embedded in the eBook that can be used to identify the purchaser of the eBook in the event of misuse and to provide evidence for legal purposes.
For more information, see our eBook Help page.