The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals.

Jon Feldman Matthias Ruhl

Published in: FOCS (1999)

Keyphrases

small number
computational complexity
communication cost
databases
machine learning
fixed number
real time
information retrieval
database systems
digital libraries
shortest path
computational problems