d-MinIntSep is NP-hard and inapproximable to within a logarithmic factor; an ILP formulation computes minimum interval separators and is tested on synthetic and real transportation temporal networks.
and Lafond, M., Novel complexity results for t emporal separators with deadlines, in 19th International Symposium on Algorithms and Data Struct ures, April 29, 2026 0:57 main 14 R
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Testing Robustness of Temporal Transportation Networks via Interval Separators
d-MinIntSep is NP-hard and inapproximable to within a logarithmic factor; an ILP formulation computes minimum interval separators and is tested on synthetic and real transportation temporal networks.