Algorithmic Aspects in Information and Management [electronic resource] : 18th International Conference, AAIM 2024, Virtual Event, September 21-23, 2024, Proceedings, Part II / 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 ; 15180Editor: Singapore : Springer Nature Singapore : Imprint: Springer, 2024Edición: 1st ed. 2024Descripción: XV, 268 p. 63 illus., 37 illus. in color. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9789819778010Tema(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:
-- 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.
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

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

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