1 paper
Prashanth Amireddy, Chetan Sai Digumarthi
We give a dynamic programming solution to find the minimum cost of a diameter constrained Steiner tree in case of directed graphs. Then we show a simple reduction from undirected v…