Polynomial Time Approximation Schemes and Parameterized Complexity

Jianer Chen; Xiuzhen Huang; Iyad A. Kanj; Ge Xia

doi:10.1007/978-3-540-28629-5_38

Polynomial Time Approximation Schemes and Parameterized Complexity

Jianer Chen
, Xiuzhen Huang
, Iyad A. Kanj
, Ge Xia

Texas A and M University

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Jirí Fiala, Jan Kratochvíl, Vá clav Koubek
Publisher	Springer Verlag
Pages	500-512
Number of pages	13
ISBN (Electronic)	3540228233, 9783540228233
DOIs	https://doi.org/10.1007/978-3-540-28629-5_38
State	Published - 2004

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3153
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

ASJC Scopus Subject Areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-28629-5_38

Cite this

Chen, J., Huang, X., Kanj, I. A., & Xia, G. (2004). Polynomial Time Approximation Schemes and Parameterized Complexity. In J. Fiala, J. Kratochvíl, & V. C. Koubek (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 500-512). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3153). Springer Verlag. https://doi.org/10.1007/978-3-540-28629-5_38

Polynomial Time Approximation Schemes and Parameterized Complexity. / Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A. et al.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Jirí Fiala; Jan Kratochvíl; Vá clav Koubek. Springer Verlag, 2004. p. 500-512 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3153).

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Chen, J, Huang, X, Kanj, IA & Xia, G 2004, Polynomial Time Approximation Schemes and Parameterized Complexity. in J Fiala, J Kratochvíl & VC Koubek (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3153, Springer Verlag, pp. 500-512. https://doi.org/10.1007/978-3-540-28629-5_38

Chen J, Huang X, Kanj IA, Xia G. Polynomial Time Approximation Schemes and Parameterized Complexity. In Fiala J, Kratochvíl J, Koubek VC, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2004. p. 500-512. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-28629-5_38

Chen, Jianer ; Huang, Xiuzhen ; Kanj, Iyad A. et al. / Polynomial Time Approximation Schemes and Parameterized Complexity. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Jirí Fiala ; Jan Kratochvíl ; Vá clav Koubek. Springer Verlag, 2004. pp. 500-512 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{0e512521d6fb49d6998d0f392a07b577,

title = "Polynomial Time Approximation Schemes and Parameterized Complexity",

author = "Jianer Chen and Xiuzhen Huang and Kanj, \{Iyad A.\} and Ge Xia",

year = "2004",

doi = "10.1007/978-3-540-28629-5\_38",

language = "English",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "500--512",

editor = "Jir{\'i} Fiala and Jan Kratochv{\'i}l and Koubek, \{V{\'a} clav\}",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - CHAP

T1 - Polynomial Time Approximation Schemes and Parameterized Complexity

AU - Chen, Jianer

AU - Huang, Xiuzhen

AU - Kanj, Iyad A.

AU - Xia, Ge

PY - 2004

Y1 - 2004

UR - https://www.scopus.com/pages/publications/21144445656

UR - https://www.scopus.com/pages/publications/21144445656#tab=citedBy

U2 - 10.1007/978-3-540-28629-5_38

DO - 10.1007/978-3-540-28629-5_38

M3 - Chapter

AN - SCOPUS:21144445656

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 500

EP - 512

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Fiala, Jirí

A2 - Kratochvíl, Jan

A2 - Koubek, Vá clav

PB - Springer Verlag

ER -

Polynomial Time Approximation Schemes and Parameterized Complexity

Publication series

ASJC Scopus Subject Areas

Access to Document

Other files and links

Cite this