The Complexity of an Optimal File Transfer Problem

Yoshihiro KANEKO  Shoji SHINODA  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E82-A   No.2   pp.394-397
Publication Date: 1999/02/25
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Graphs and Networks
file transmission net,  file transfer,  Steiner tree,  NP-complete,  

Full Text: PDF>>
Buy this Article

A problem of obtaining an optimal file transfer on a file transmission net N is to consider how to distribute, with a minimum total cost, copies of a certain file of information from some vertices to others on N by the respective vertices' copy demand numbers. This paper proves such a problem to be NP-hard in general.