{"id":"https://openalex.org/W2286486211","doi":null,"title":"Parameterized complexity and polynomial-time approximation schemes","display_name":"Parameterized complexity and polynomial-time approximation schemes","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2286486211","mag":"2286486211"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.219.293","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.219.293","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://txspace.tamu.edu/bitstream/1969/1446/1/etd-tamu-2004C-CPSC-Huang.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021456840","display_name":"Xiuzhen Huang","orcid":"https://orcid.org/0000-0003-0498-3131","observed_orcids":["https://orcid.org/0000-0003-0498-3131"]},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiuzhen Huang","raw_affiliation_strings":["\u2020Texas A&M University"],"raw_orcid":"https://orcid.org/0000-0003-0498-3131","affiliations":[{"raw_affiliation_string":"\u2020Texas A&M University","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023394727","display_name":"Jianer Chen","orcid":"https://orcid.org/0000-0003-0898-1643","observed_orcids":["https://orcid.org/0000-0003-0898-1643","https://orcid.org/0000-0002-7101-208X"]},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jianer Chen","raw_affiliation_strings":["\u2020Texas A&M University"],"raw_orcid":"https://orcid.org/0000-0003-0898-1643","affiliations":[{"raw_affiliation_string":"\u2020Texas A&M University","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":3.916,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.93636364,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9682999849319458,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9682999849319458,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.029600000008940697,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"parameterized complexity","score":0.996999979019165},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"polynomial-time approximation scheme","score":0.9890000224113464},{"id":"https://openalex.org/keywords/fully-polynomial-time-approximation-scheme","display_name":"fully polynomial time approximation scheme","score":0.8379999995231628},{"id":"https://openalex.org/keywords/np-optimization-problems","display_name":"NP optimization problems","score":0.8169999718666077},{"id":"https://openalex.org/keywords/computational-lower-bounds","display_name":"computational lower bounds","score":0.890999972820282},{"id":"https://openalex.org/keywords/clique-problem","display_name":"clique problem","score":0.8939999938011169},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.5519999861717224},{"id":"https://openalex.org/keywords/parameterized-algorithms","display_name":"parameterized algorithms","score":0.6110000014305115}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9569926261901855},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6718011498451233},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6595404744148254},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6329543590545654},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.612817108631134},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5050297379493713},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4965417981147766},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4719770848751068},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.451882004737854},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.43390604853630066},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42960837483406067},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40054214000701904},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27917975187301636},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.219.293","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.219.293","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://txspace.tamu.edu/bitstream/1969/1446/1/etd-tamu-2004C-CPSC-Huang.pdf","raw_type":"text"},{"id":"pmh:oai:oaktrust.library.tamu.edu:1969.1/1446","doi":null,"is_oa":false,"landing_page_url":"https://hdl.handle.net/1969.1/1446","pdf_url":null,"source":{"id":"https://openalex.org/S4306400291","display_name":"OakTrust (Texas A&M University Libraries)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I91045830","host_organization_name":"Texas A&M University","host_organization_lineage":["https://openalex.org/I91045830"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},{"id":"mag:2286486211","doi":null,"is_oa":false,"landing_page_url":"https://oaktrust.library.tamu.edu/bitstream/1969.1/1446/1/etd-tamu-2004C-CPSC-Huang.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":68,"referenced_works":["https://openalex.org/W104109059","https://openalex.org/W261953367","https://openalex.org/W282367566","https://openalex.org/W1519147138","https://openalex.org/W1529279241","https://openalex.org/W1557842781","https://openalex.org/W1562906735","https://openalex.org/W1569638820","https://openalex.org/W1580213736","https://openalex.org/W1598441350","https://openalex.org/W1599092334","https://openalex.org/W1834737061","https://openalex.org/W1840899162","https://openalex.org/W1966275651","https://openalex.org/W1971756951","https://openalex.org/W1972853793","https://openalex.org/W1976960787","https://openalex.org/W1979149941","https://openalex.org/W1979740015","https://openalex.org/W1982180670","https://openalex.org/W1983156760","https://openalex.org/W1986447712","https://openalex.org/W1987374783","https://openalex.org/W1987681136","https://openalex.org/W1990313671","https://openalex.org/W1993920925","https://openalex.org/W1995725694","https://openalex.org/W1999591020","https://openalex.org/W2005485907","https://openalex.org/W2007979101","https://openalex.org/W2010260400","https://openalex.org/W2011039300","https://openalex.org/W2017290750","https://openalex.org/W2018964411","https://openalex.org/W2025038593","https://openalex.org/W2026891055","https://openalex.org/W2027049731","https://openalex.org/W2027999353","https://openalex.org/W2037968786","https://openalex.org/W2038225707","https://openalex.org/W2040176884","https://openalex.org/W2040922070","https://openalex.org/W2043177640","https://openalex.org/W2043997666","https://openalex.org/W2047386086","https://openalex.org/W2053548601","https://openalex.org/W2056090079","https://openalex.org/W2062172380","https://openalex.org/W2067297441","https://openalex.org/W2073025989","https://openalex.org/W2074210283","https://openalex.org/W2097844290","https://openalex.org/W2101407539","https://openalex.org/W2113743851","https://openalex.org/W2115667895","https://openalex.org/W2127113976","https://openalex.org/W2144809360","https://openalex.org/W2156760067","https://openalex.org/W2163751818","https://openalex.org/W2165142526","https://openalex.org/W2177603603","https://openalex.org/W2179980496","https://openalex.org/W2473790798","https://openalex.org/W2486715098","https://openalex.org/W2798588639","https://openalex.org/W2913688336","https://openalex.org/W4255801061","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2399100966","https://openalex.org/W2007441033","https://openalex.org/W2092838574","https://openalex.org/W4408987688","https://openalex.org/W1987681136","https://openalex.org/W2487732880","https://openalex.org/W2183312547","https://openalex.org/W2553294256","https://openalex.org/W2130190334","https://openalex.org/W2768378078"],"abstract_inverted_index":{"According":[0],"to":[1,53,69,181,263,317,356],"the":[2,17,85,102,141,149,156,165,193,212,233,237,251,341,362,369],"theory":[3,142,194],"of":[4,19,29,49,59,88,143,148,162,169,195,236,247,254,273,292,364,371],"NPcompleteness,":[5],"many":[6],"problems":[7,190,283],"that":[8,202,240,279],"have":[9,31,288,325,348],"important":[10,123,173],"realworld":[11],"applications":[12],"are":[13,41],"NPhard.":[14],"This":[15,229,354],"excludes":[16],"possibility":[18],"solving":[20],"them":[21,40],"in":[22,34,62,125,208,219,250,314],"polynomial":[23,63,315],"time":[24,220,294,316,343],"unless":[25,203],"P=NP.":[26],"A":[27],"number":[28],"approaches":[30],"been":[32,349],"proposed":[33],"dealing":[35],"with":[36,284],"NPhard":[37],"problems,":[38,307],"among":[39],"approximation":[42,50,92,109,174,329],"algorithms":[43,51,67,93,272,287,291,330],"and":[44,91,107,133,159,243,270],"parameterized":[45,66,89,105,144,189,196,209],"algorithms.":[46,353],"The":[47],"study":[48,84,363],"tries":[52],"\ufb01nd":[54],"good":[55],"enough":[56],"solutions":[57,61,72],"instead":[58],"optimal":[60],"time,":[64],"while":[65],"try":[68],"give":[70,118],"exact":[71],"when":[73],"a":[74,358],"natural":[75],"parameter":[76],"is":[77,164,340],"small.":[78],"\\n":[79,116,176,226,257],"\\nIn":[80],"this":[81,170,339],"thesis,":[82],"we":[83,100,200],"structural":[86],"properties":[87],"computation":[90],"for":[94,112,121,187,223,268,297,303,331,351,361],"NP":[95,113,274,281,305,372],"optimization":[96,114,275,282,306,373],"problems.":[97,115,276,374],"In":[98],"particular,":[99],"investigate":[101],"relationship":[103],"between":[104],"complexity":[106,210],"polynomialtime":[108],"scheme":[110],"(PTAS)":[111],"\\nWe":[117,177,258],"nice":[119],"characterizations":[120],"two":[122],"subclasses":[124],"PTAS:":[126],"Fully":[127],"Polynomial":[128,135],"Time":[129,136],"Approximation":[130,137],"Scheme":[131,138],"(FPTAS)":[132],"Effcient":[134],"(EPTAS),":[139],"using":[140],"complexity.":[145,197],"Our":[146],"characterization":[147,161],"class":[150],"FPTAS":[151],"has":[152],"its":[153],"advantages":[154],"over":[155],"former":[157],"characterizations,":[158],"our":[160,261,337],"EPTAS":[163,271],"\ufb01rst":[166,342],"systematic":[167],"investigation":[168],"new":[171,179,359],"but":[172],"class.":[175],"develop":[178],"techniques":[180,262],"derive":[182,264],"strong":[183],"computational":[184,265,365],"lower":[185,230,266,345,366],"bounds":[186,267,367],"certain":[188,280],"based":[191],"on":[192,368],"For":[198],"example,":[199],"prove":[201,278],"an":[204,318],"unlikely":[205],"collapse":[206],"occurs":[207],"theory,":[211],"clique":[213],"problem":[214],"could":[215],"not":[216],"be":[217,312],"solved":[218],"O(f":[221,295],"(k)no(k))":[222],"any":[224,298],"function":[225,299],"\\nf":[227],".":[228,301],"bound":[231,235,322,334,346],"matches":[232],"upper":[234],"trivial":[238],"algorithm":[239],"simply":[241],"enumerates":[242],"checks":[244],"all":[245],"subsets":[246],"k":[248],"vertices":[249],"given":[252],"graph":[253],"n":[255],"vertices.":[256],"then":[259],"extend":[260],"PTAS":[269,286,290,352],"We":[277],"known":[285],"no":[289,326],"running":[293],"(1/Epsilon)no(1/Epsilon))":[296],"f":[300],"Therefore,":[302],"these":[304],"although":[308],"theoretically":[309],"they":[310,324],"can":[311],"approximated":[313],"arbitrarily":[319],"small":[320,332],"error":[321,333],"Epsilon,":[323],"practically":[327],"effective":[328],"Epsilon.":[335],"To":[336],"knowledge,":[338],"such":[344],"results":[347],"derived":[350],"seems":[355],"open":[357],"direction":[360],"approximability":[370]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}