LEADER 03629nam 22006255 450 001 9910841861403321 005 20240222125238.0 010 $a9783031468261 024 7 $a10.1007/978-3-031-46826-1 035 $a(CKB)30499615100041 035 $a(MiAaPQ)EBC31176043 035 $a(Au-PeEL)EBL31176043 035 $a(DE-He213)978-3-031-46826-1 035 $a(EXLCZ)9930499615100041 100 $a20240222d2024 u| 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aGraphs and Combinatorial Optimization: from Theory to Applications$b[electronic resource] $eCTW 2023, Garmisch-Partenkirchen, Germany, June 20?22 /$fedited by Andreas Brieden, Stefan Pickl, Markus Siegle 205 $a1st ed. 2024. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2024. 215 $a1 online resource (204 pages) 225 1 $aAIRO Springer Series,$x2523-7055 ;$v13 311 08$a9783031468254 327 $aOn 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. 330 $aThis 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. 410 0$aAIRO Springer Series,$x2523-7055 ;$v13 606 $aMathematical optimization 606 $aGraph theory 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aOptimization 606 $aGraph Theory 606 $aMathematics of Computing 606 $aApplications of Discrete Mathematics 615 0$aMathematical optimization. 615 0$aGraph theory. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 14$aOptimization. 615 24$aGraph Theory. 615 24$aMathematics of Computing. 615 24$aApplications of Discrete Mathematics. 676 $a519.6 700 $aBrieden$b Andreas$01730762 701 $aPickl$b Stefan$0472376 701 $aSiegle$b Markus$01730763 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 912 $a9910841861403321 996 $aGraphs and Combinatorial Optimization: from Theory to Applications$94142109 997 $aUNINA