The complexity of weighted Boolean #CSP with mixed signs
- 作者Andrei Bulatov; Martin Dyer; Leslie Ann Goldberg; Markus Jalsenius; David Richerby
- 卷第410卷
- 印刷ISSN0304-3975
- 文件大小779.99KB
- 发表时间2009
- DOI10.1016/j.tcs.2009.06.003
- 页码3949-3961
Improved upper bounds for vertex coverJianer Chen; Iyad A. Kanj; Ge Xia · 2010
Polynomial time approximation schemes and parameterized complexityJianer Chen; Xiuzhen Huang; Iyad A. Kanj; Ge Xia · 2007
Strong computational lower bounds via parameterized complexityJianer Chen; Xiuzhen Huang; Iyad A. Kanj; Ge Xia · 2006
On the pseudo-achromatic number problemJianer Chen; Iyad A. Kanj; Jie Meng; Ge Xia; Fenghui Zhang · 2009
Separability and topology control of quasi unit disk graphsJianer Chen; Anxiao (Andrew) Jiang; Iyad A. Kanj; Ge Xia; Fenghui Zhang · 2011
On the computational hardness based on linear FPT-reductionsJianer Chen; Xiuzhen Huang; Iyad A. Kanj; Ge Xia · Journal of Combinatorial Optimization · 2006
Tight lower bounds for certain parameterized NP-hard problemsJianer Chen; Benny Chor; Mike Fellows; Xiuzhen Huang; David Juedes; Iyad A. Kanj; Ge Xia · 2005