1. Andrews M, Zhang L (2005) Hardness of the undirected congestion minimization problem. In: Proceedings of the 37th annual ACM symposium on theory of computing, pp 284–293
2. Chuzhoy J, Naor J (2004) New hardness results for congestion minimization and machine scheduling. In: Proceedings of the 36th annual ACM symposium on theory of computing. ACM, New York, pp 28–34
3. Erdös P, Lovász L (1975) Problems and results on 3-chromatic hypergraphs and some related questions. Colloq Math Soc János Bolyai 10:609–627
4. Goldberg LA, Patterson M, Srinivasan A, Sweedick E (2001) Better approximation guarantees for job-shop scheduling. SIAM J Discret Math 14(1):67–92
5. Leighton FT, Maggs BM, Rao SB (1994) Packet routing and jobs-hop scheduling in O(congestion+dilation) steps. Combinatorica 14(2):167–180