{"id":"https://openalex.org/W2155478504","doi":"https://doi.org/10.1145/1863495.1863508","title":"Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning","display_name":"Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning","publication_year":2010,"publication_date":"2010-09-26","ids":{"openalex":"https://openalex.org/W2155478504","doi":"https://doi.org/10.1145/1863495.1863508","mag":"2155478504"},"language":"en","primary_location":{"id":"doi:10.1145/1863495.1863508","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1863495.1863508","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 6th ACM SIGPLAN workshop on Generic programming","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"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/A5002724938","display_name":"Shin-Cheng Mu","orcid":"https://orcid.org/0000-0002-4755-601X"},"institutions":[{"id":"https://openalex.org/I84653119","display_name":"Academia Sinica","ror":"https://ror.org/05bxb3784","country_code":"TW","type":"facility","lineage":["https://openalex.org/I84653119"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Shin-Cheng Mu","raw_affiliation_strings":["Academia Sinica, Taipei, Taiwan Roc"],"affiliations":[{"raw_affiliation_string":"Academia Sinica, Taipei, Taiwan Roc","institution_ids":["https://openalex.org/I84653119"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084939277","display_name":"Yu-Han Lyu","orcid":"https://orcid.org/0000-0002-9344-0499"},"institutions":[{"id":"https://openalex.org/I84653119","display_name":"Academia Sinica","ror":"https://ror.org/05bxb3784","country_code":"TW","type":"facility","lineage":["https://openalex.org/I84653119"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yu-Han Lyu","raw_affiliation_strings":["Academia Sinica, Taipei, Taiwan Roc"],"affiliations":[{"raw_affiliation_string":"Academia Sinica, Taipei, Taiwan Roc","institution_ids":["https://openalex.org/I84653119"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037284935","display_name":"Akimasa Morihata","orcid":"https://orcid.org/0000-0003-2741-5954"},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Akimasa Morihata","raw_affiliation_strings":["Tohoku University, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Tohoku University, Tokyo, Japan","institution_ids":["https://openalex.org/I201537933"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002724938"],"corresponding_institution_ids":["https://openalex.org/I84653119"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.18058298,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"97","last_page":"108"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9988999962806702,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9988999962806702,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T11034","display_name":"Digital Filter Design and Implementation","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/thinning","display_name":"Thinning","score":0.7684572339057922},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5662494897842407},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5125696659088135},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5045338869094849},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5015506744384766},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.48665863275527954},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4845503866672516},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.46382299065589905},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4476642608642578},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.42756733298301697},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3839559555053711},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3831331431865692},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3263383209705353},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15000376105308533},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.04961523413658142}],"concepts":[{"id":"https://openalex.org/C2781353100","wikidata":"https://www.wikidata.org/wiki/Q1266974","display_name":"Thinning","level":2,"score":0.7684572339057922},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5662494897842407},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5125696659088135},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5045338869094849},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5015506744384766},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.48665863275527954},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4845503866672516},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.46382299065589905},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4476642608642578},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.42756733298301697},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3839559555053711},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3831331431865692},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3263383209705353},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15000376105308533},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.04961523413658142},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1863495.1863508","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1863495.1863508","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 6th ACM SIGPLAN workshop on Generic programming","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1483728665","https://openalex.org/W1513445195","https://openalex.org/W1520111182","https://openalex.org/W1535963758","https://openalex.org/W1542883217","https://openalex.org/W1554287520","https://openalex.org/W1977140313","https://openalex.org/W1992734168","https://openalex.org/W2009990213","https://openalex.org/W2015101476","https://openalex.org/W2016093456","https://openalex.org/W2026891055","https://openalex.org/W2039775944","https://openalex.org/W2136658137","https://openalex.org/W2143566245","https://openalex.org/W2151708648","https://openalex.org/W4235358177","https://openalex.org/W6628772710","https://openalex.org/W6632165514","https://openalex.org/W6634383297","https://openalex.org/W6644631812","https://openalex.org/W7065312267"],"related_works":["https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W2048358792","https://openalex.org/W2098281589","https://openalex.org/W3204684126","https://openalex.org/W2970302286","https://openalex.org/W1481223916","https://openalex.org/W3117290964","https://openalex.org/W2962917430","https://openalex.org/W1903284337"],"abstract_inverted_index":{"The":[0],"fully":[1],"polynomial-time":[2],"approximation":[3,10,55],"scheme":[4],"(FPTAS)":[5],"is":[6,13,86],"a":[7,36,45,62],"class":[8],"of":[9,64,76,83,92],"algorithms":[11,56,95],"that":[12],"able":[14],"to":[15,35,98],"deliver":[16],"an":[17,70],"approximate":[18],"solution":[19],"within":[20],"any":[21],"chosen":[22],"ratio":[23],"in":[24,68,78,103],"polynomial":[25],"time.":[26],"By":[27],"generalising":[28],"Bird":[29],"and":[30,54,90],"de":[31],"Moor's":[32],"Thinning":[33],"Theorem":[34],"property":[37],"between":[38],"three":[39],"orderings,":[40],"we":[41],"come":[42],"up":[43],"with":[44],"datatype-generic":[46],"strategy":[47],"for":[48],"constructing":[49,69],"fold-based":[50],"FPTASs.":[51],"Greedy,":[52],"thinning,":[53],"can":[57],"thus":[58,87],"be":[59,99],"seen":[60],"as":[61],"series":[63],"generalisations.":[65],"Components":[66],"needed":[67],"FPTAS":[71],"are":[72],"often":[73],"natural":[74],"extensions":[75],"those":[77,102],"the":[79,93],"thinning":[80],"algorithm.":[81],"Design":[82],"complex":[84],"FPTASs":[85],"made":[88],"easier,":[89],"some":[91],"resulting":[94],"turn":[96],"out":[97],"simpler":[100],"than":[101],"previous":[104],"works.":[105]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}