Record Type: |
Electronic resources
: Monograph/item
|
Title/Author: |
Graphs and combinatorial optimization/ edited by Andreas Brieden, Stefan Pickl, Markus Siegle. |
Reminder of title: |
from Theory to Applications : CTW 2023, Garmisch-Partenkirchen, Germany, June 20-22 / |
remainder title: |
CTW 2023 |
other author: |
Brieden, Andreas. |
corporate name: |
Cologne-Twente Workshop on Graphs and Combinatorial Optimization |
Published: |
Cham :Springer Nature Switzerland : : 2024., |
Description: |
x, 202 p. :ill. (some col.), digital ;24 cm. |
[NT 15003449]: |
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. |
Contained By: |
Springer Nature eBook |
Subject: |
Graph theory - Congresses. - |
Online resource: |
https://doi.org/10.1007/978-3-031-46826-1 |
ISBN: |
9783031468261 |