Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. R. Aleliunas, “Randomized parallel communication”, Proc. of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 60–72, 1982.
2. M. Bellare, M. Sudan, “Improved non-approximability results”, Proc. of the 26th Annual ACM Symposium on Theory of Computing, 184–193, 1994.
3. I. Cidon, S. Kutten, Y. Mansour, D. Peleg, “Greedy packet scheduling”, Proc. of 4th Workshop on Distributed Algorithms, 1990.
4. A. Clementi, M. Di Ianni, “Optimum Schedule Problem in Store and Forward networks”, Proc. of the IEEE INFOCOM'94, 1336–1343, 1994.
5. A. Clementi, M. Di Ianni, “On the hardness of approximating optimum schedule problems in Store and Forward networks”, to appear in IEEE-ACM Transactions on Networking, 1995.