Algorithmic Aspects in Information and Management 18th International Conference, AAIM 2024, Virtual Event, September 21–23, 2024, Proceedings, Part I /

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 re...

Descrizione completa

Salvato in:
Dettagli Bibliografici
Ente Autore: SpringerLink (Online service)
Altri autori: Ghosh, Smita (Redattore), Zhang, Zhao (Redattore)
Natura: Elettronico eBook
Lingua:inglese
Pubblicazione: Singapore : Springer Nature Singapore : Imprint: Springer, 2024.
Edizione:1st ed. 2024.
Serie:Lecture Notes in Computer Science, 15179
Soggetti:
Accesso online:https://doi.org/10.1007/978-981-97-7798-3
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
Sommario:
  • -- 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.