An exact ILP models the combined capacitated subnetwork design and dynamic shortest-path routing problem, with experiments showing that fixing routes first and deactivating unused links yields near-optimal solutions.
Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
extension 1
citation-polarity summary
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1roles
extension 1polarities
extend 1representative citing papers
citing papers explorer
-
Designing Capacitated Subnetworks for Shortest Path Routing
An exact ILP models the combined capacitated subnetwork design and dynamic shortest-path routing problem, with experiments showing that fixing routes first and deactivating unused links yields near-optimal solutions.