Parameterized Approximation Problems
暂无分享,去创建一个
Michael R. Fellows | Catherine McCartin | Rodney G. Downey | R. Downey | M. Fellows | Catherine McCartin
[1] Luca Trevisan,et al. On the Efficiency of Polynomial Time Approximation Schemes , 1997, Inf. Process. Lett..
[2] Liming Cai,et al. Fixed-Parameter Approximation: Conceptual Framework and Approximability Results , 2006, IWPEC.
[3] Catherine McCartin,et al. Online Problems, Pathwidth, and Persistence , 2004, IWPEC.
[4] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[6] Catherine McCartin,et al. CONTRIBUTIONS TO PARAMETERIZED COMPLEXITY , 2003 .
[7] Jörg Flum,et al. The parameterized complexity of counting problems , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..