The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The k-path tree matroid and its applications to survivable network design
Discrete Optimization
Hi-index | 0.04 |