Author:
Ageev Alexander A.,Fishkin Aleksei V.,Kononov Alexander V.,Sevastianov Sergey V.
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Lecture Notes in Computer Science;A.K. Amoura,1997
2. Lecture Notes in Computer Science;E. Bampis,2002
3. Fiala, T.: An algorithm for the open-shop problem. Math. Oper. Res. 8, 100–109 (1983)
4. Lecture Notes in Computer Science;A.V. Fishkin,2001
5. Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco (1979)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Minimum Load Coloring Problem;Approximation and Online Algorithms;2006
2. Coloring Graphs with Minimal Edge Load;Electronic Notes in Discrete Mathematics;2004-10