Author:
Halldórsson Magnús M.,Kortsarz Guy,Radhakrishnan Jaikumar,Sivasubramanian Sivaramakrishnan
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference38 articles.
1. S. Arora and C. Lund: Hardness of approximations, in: D. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, 1996.
2. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy: Proof verification and hardness of approximation problems, J. ACM 45(3) (1998), 501–555.
3. R. Balasubramanian, V. Raman and V. Yegnanarayanan: On the pseudoachromatic number of join of graphs, J. Computer Math. 80 (2003), 1131–1137.
4. H. L. Bodlaender: Achromatic number is NP-complete for cographs and interval graphs, Inform. Process. Lett. 31(3) (1989), 135–138.
5. V. N. Bhave: On the pseudoachromatic number of a graph, Fund. Math. 102(3) (1979), 159–164.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献