Time-expanded packings

DOI10.1007/978-3-662-43948-7_6MaRDI QIDQ5167731zbMATH OpenOpenAlexFDO

Authors David Adjiashvili, Sandro Bosio, Robert Weismantel, Rico Zenklusen

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

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

Recommendations

• Fast approximation of matroid packing and covering
• Near-linear time approximation schemes for some implicit fractional packing problems
• On packing time-respecting arborescences
• Abstract flows over time: a first step towards solving dynamic packing problems
• Quickest Flows Over Time

Cited in

(6)

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

This page was built for publication: Time-expanded packings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5167731)