On the hardness of approximating optimum schedule problems in store and forward networks | IEEE Journals & Magazine | IEEE Xplore