Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Arora, S., Lund, C, Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. Proceedings of the 33rd IEEE Symposium on the Foundations of Computer Science (1992) 14–23
2. Carlisle, M.C., Lloyd, E.L.: On the k-coloring of intervals. Discrete Applied Mathematics 59 (1995) 225–235
3. Carter, M.W., Tovey, C.A.: When is the classroom assignment problem hard? Operations Research 40 (1992) S28–S39
4. Crescenzi, P., Kann, V.: A compendium of NP optimization problems, http://www.nada.kth.se/nada/~viggo/problemlist/compendium.html
5. Faigle, U., Nawijn, W.M.: Note on scheduling intervals on-line. Discrete Applied Mathematics 58 (1995) 13–17
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献