Graphs and Combinatorial Optimization: from Theory to Applications - CTW 2023, Garmisch-Partenkirchen, Germany, June 20-22
Reduzierte Artikel in dieser Kategorie
8,99 €
4,99 €
6,99 €
5,99 €
4,99 €
8,99 €
5,99 €
| Verlag | Springer |
| Auflage | 2024 |
| Seiten | 202 |
| Format | 16,4 x 1,7 x 23,8 cm |
| Gewicht | 473 g |
| Artikeltyp | Englisches Buch |
| Reihe | AIRO Springer Series 13 |
| ISBN-10 | 3031468252 |
| EAN | 9783031468254 |
| Bestell-Nr | 03146825A |
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.
Inhaltsverzeichnis:
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.
