Algorithmic Aspects in Information and Management [electronic resource] : 18th International Conference, AAIM 2024, Virtual Event, September 21-23, 2024, Proceedings, Part I / edited by Smita Ghosh, Zhao Zhang.

Colaborador(es): Ghosh, Smita [editor.] | Zhang, Zhao [editor.] | SpringerLink (Online service)Tipo de material: TextoTextoSeries Lecture Notes in Computer Science ; 15179Editor: Singapore : Springer Nature Singapore : Imprint: Springer, 2024Edición: 1st ed. 2024Descripción: XVI, 288 p. 46 illus., 29 illus. in color. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9789819777983Tema(s): Computer science -- Mathematics | Discrete mathematics | Data structures (Computer science) | Information theory | Artificial intelligence | Computer science | Discrete Mathematics in Computer Science | Data Structures and Information Theory | Artificial Intelligence | Theory of ComputationFormatos físicos adicionales: Printed edition:: Sin título; Printed edition:: Sin títuloClasificación CDD: 004.0151 Clasificación LoC:QA76.9.M35QA297.4Recursos en línea: Libro electrónicoTexto
Contenidos:
-- 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.
En: Springer Nature eBookResumen: 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.
Star ratings
    Valoración media: 0.0 (0 votos)
Existencias
Tipo de ítem Biblioteca actual Colección Signatura Copia número Estado Fecha de vencimiento Código de barras
Libro Electrónico Biblioteca Electrónica
Colección de Libros Electrónicos 1 No para préstamo

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

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.

UABC ; Perpetuidad

Con tecnología Koha