The complexity of the capacitated tree problem

Christos H. Papadimitriou

Abstract: We examine the complexity of a classical problem related to the design of centralized computer networks. Under very broad assumptions the problem is shown to be NP-complete, and hence most probably i...