CTW 2023, Garmisch-Partenkirchen, Germany, June 20–22 Brieden, Andreas. editor. edt http://id.loc.gov/vocabulary/relators/edt Pickl, Stefan. editor. edt http://id.loc.gov/vocabulary/relators/edt Siegle, Markus. editor. edt http://id.loc.gov/vocabulary/relators/edt SpringerLink (Online service) text sz 2024 1st ed. 2024. monographic eng

electronic

electronic resource

access X, 202 p. 40 illus., 25 illus. in color. online resource. This book contains the proceedings of the 19th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, held during June 20-22, 2023, in Garmisch-Partenkirchen, Germany. This successful series of international workshops is known to attract high-quality research on the theory and application of discrete algorithms, graphs, and combinatorial optimization in a wide sense. The papers collected in this book represent cutting-edge research by leading researchers and attract a broad readership in academia worldwide. The book is addressed to researchers and advanced students, but also to professionals in industry concerned with algorithm design and optimization problems in different areas of application. On syntactical graphs-of-words -- k-slow Burning: Complexity and Upper Bounds -- Exact approaches for the Connected Vertex Cover problem -- Handling Sub-symmetry in Integer Programming using Activation Handlers -- Online Facility Location: comparing ad-hoc and MIP-based algorithms -- A Multivariate Complexity Analysis of the Generalized Noah’s Ark Problem -- On the Optimality Gap of Full Airport Slot Assignments: Capacity-limited Packing with Pareto Optimality Constraints -- The algorithmic complexity of the Paired Matching problem -- Edge Contraction and Forbidden Induced Subgraphs -- Rigidity of frameworks on spheres -- Discrepancies of subtrees.-Data-driven feasibility for the Resource Constraint Shortest Path Problem.-Monte-Carlo Integration on a Union of Polytopes -- Managing Time Expanded Networks: The Strong Lift Problem. edited by Andreas Brieden, Stefan Pickl, Markus Siegle. Mathematical optimization Graph theory Computer science Mathematics Discrete mathematics Optimization Graph Theory Mathematics of Computing Applications of Discrete Mathematics QA402.5-402.6 9783031468261 https://doi.org/10.1007/978-3-031-46826-1 https://doi.org/10.1007/978-3-031-46826-1 240222 20251030111438.0 978-3-031-46826-1