Daniel P. Bovet;Pierluigi Crescenzi
Univ. of Rome, Rome, Italy;Univ. of L'Aquilla, L'Aquilla, Italy
On the hardness of approximating optimum schedule problems in store and forward networks
IEEE/ACM Transactions on Networking (TON)