Author:
Adamaszek Anna,Popa Alexandru
Funder
Danish Council for Independent Research
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference17 articles.
1. Approximation and hardness results for the maximum edge q-coloring problem;Adamaszek,2010
2. On the hardness of approximating minimum vertex cover;Dinur;Ann. Math.,2005
3. A new multilayered PCP and the hardness of hypergraph vertex cover;Dinur;SIAM J. Comput.,2005
4. Anti-Ramsey theorems;Erdős,1975
5. Approximation algorithms for maximum edge coloring problem;Feng,2007
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献