Algorithmic Aspects in Information and Management
Springer Nature (Verlag)
978-981-97-7797-6 (ISBN)
The 45 full papers presented in these two volumes were carefully reviewed and selected from 76 submissions.
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.
.- 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.
| Erscheinungsdatum | 20.09.2024 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | 29 Illustrations, color; 17 Illustrations, black and white; XVI, 288 p. 46 illus., 29 illus. in color. |
| Verlagsort | Singapore |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Angewandte Mathematik | |
| Schlagworte | Algorithmic game theory and incentive analysis • algorithms and data structures • Approximation algorithms and online algorithms • Automata, languages, logic, and computability • Blockchain • combinatorial optimization • Combinatorics and discrete structures related to algorithms • Communication networks and optimization • Complexity theory • Computational learning theory, knowledge discovery, data mining • Cryptography, reliability, and security • Graph algorithms and theory • Large graph algorithms and social network analysis • Optimization algorithms in economic and operations research • Parallel and distributed computing and multicore algorithms • Quantum Computing |
| ISBN-10 | 981-97-7797-6 / 9819777976 |
| ISBN-13 | 978-981-97-7797-6 / 9789819777976 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
