Learning and Intelligent Optimization: 15th International Conference, LION 15, Athens, Greece, June 20-25, 2021, Revised Selected Papers, Simos Dimitris E., Pardalos Panos M., Kotsireas Ilias S.
Описание: This book constitutes the revised papers of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2020, held in Leeds, UK, in June 2020.
Описание: This book constitutes the thoroughly refereed workshop post-proceedings of the 19th International Workshop on Approximation and Online Algorithms, WAOA 2021, held in September 2021.
Описание: This book constitutes the refereed post-conference proceedings on Learning and Intelligent Optimization, LION 14, held in Athens, Greece, in May 2020.
Описание: The papers focus on advancedresearch developments in such interconnected fields as mathematical programming, global optimization, machine learning, and artificial intelligence and describe advanced ideas, technologies, methods, and applications in optimization and machine learning.
Описание: Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set.- Parameterized complexity of Bandwidth of Caterpillars and Weighted Path Emulation.- Block Elimination Distance.- On Fair Covering and Hitting Problems.- On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem.- FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More.- Disjoint Stable Matchings in Linear Time.- Complementation in T-perfect Graphs.- On subgraph complementation to H-free graphs.- Odd Cycle Transversal in Mixed Graphs.- Preventing Small $(s, t)$-Cuts by Protecting Edges.- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel.- A heuristic approach to the treedepth decomposition problem for large graphs.- The Perfect Matching Cut Problem Revisited.- The Complexity of Gerrymandering Over Graphs: Paths and Trees.- Feedback Vertex Set on Hamiltonian Graphs.- Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality.- The Dynamic Complexity of Acyclic Hypergraph Homomorphisms.- Linearizable special cases of the quadratic shortest path problem.- A Linear-time Parameterized Algorithm for Computing the Width of a DAG.- On Morphing 1-Planar Drawings.- Bears with Hats and Independence Polynomials.- The Largest Connected Subgraph Game.- Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries.- Beyond Helly graphs: the diameter problem on absolute retracts.- Acyclic, Star, and Injective Colouring: Bounding the Diameter.- The Graphs of Stably Matchable Pairs.- On additive spanners in weighted graphs with local error.- Labeling Schemes for Deterministic Radio Multi-Broadcast.- On 3-Coloring of (2P_4, C_5)-Free Graphs.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
