Non-preemptive tree packing
From MaRDI portal
Publication:5925632
DOI10.1007/s00453-022-01026-7zbMath1506.68078MaRDI QIDQ5925632
Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
Publication date: 9 March 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-01026-7
combinatorial optimization; non-preemptive scheduling; spanning tree packing; time-varying graphs; keeping a network connected over time
68R10: Graph theory (including graph drawing) in computer science
90B35: Deterministic scheduling theory in operations research
90C27: Combinatorial optimization
05C85: Graph algorithms (graph-theoretic aspects)
05C40: Connectivity
Cites Work
- Unnamed Item
- Unnamed Item
- Cyclic orderings and cyclic arboricity of matroids
- A partial k-arboretum of graphs with bounded treewidth
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Coordinated consensus in dynamic networks
- Edge-Disjoint Spanning Trees of Finite Graphs
- Optimal attack and reinforcement of a network
- Packing Spanning Trees
- Time-Expanded Packings
- Parameterized Algorithms
- Minimum partition of a matroid into independent subsets
- Scheduling
- On the spanning tree packing number of a graph: A survey