Time-Expanded Packings

DOI10.1007/978-3-662-43948-7_6zbMath1410.90173OpenAlexW102121151MaRDI QIDQ5167731

Rico Zenklusen, David Adjiashvili, Robert Weismantel, Sandro Bosio

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43948-7_6

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (max. 100)

Flexible Graph Connectivity ⋮ Scalable timing-aware network design via Lagrangian decomposition ⋮ Approximation algorithms for the generalized incremental knapsack problem ⋮ Non-preemptive tree packing ⋮ Flexible graph connectivity

This page was built for publication: Time-Expanded Packings