Minimum-Cost Node-Disjoint Steiner Trees in Series-Parallel Networks.

Sunil Chopra Kalyan T. Talluri

Published in: VLSI Design (1996)

Keyphrases

minimum cost
series parallel
steiner tree
np hard
approximation algorithms
network flow
spanning tree
network design
temporal reasoning
precedence constraints
social networks
special case
complex networks
undirected graph
social network analysis
computer networks