{"id":"https://openalex.org/W2404072309","doi":"https://doi.org/10.1201/9781351236423-10","title":"Asymptotic Polynomial Time Approximation Schemes","display_name":"Asymptotic Polynomial Time Approximation Schemes","publication_year":2018,"publication_date":"2018-05-15","ids":{"openalex":"https://openalex.org/W2404072309","doi":"https://doi.org/10.1201/9781351236423-10","mag":"2404072309"},"language":"en","primary_location":{"id":"doi:10.1201/9781351236423-10","is_oa":false,"landing_page_url":"https://doi.org/10.1201/9781351236423-10","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Handbook of Approximation Algorithms and Metaheuristics, Second Edition","raw_type":"book-chapter"},"type":"book-chapter","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/A5112649653","display_name":"Rajeev Motwani","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rajeev Motwani","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052220102","display_name":"Liadan O\u2019Callaghan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liadan O\u2019Callaghan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5054230011","display_name":"An Zhu","orcid":"https://orcid.org/0000-0002-9821-2946"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"An Zhu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.00418148,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"173","last_page":"187"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/polynomial","display_name":"Polynomial","score":0.5435523986816406},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4959803521633148},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4761410057544708},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33628422021865845},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1774124801158905}],"concepts":[{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5435523986816406},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4959803521633148},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4761410057544708},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33628422021865845},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1774124801158905}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1201/9781351236423-10","is_oa":false,"landing_page_url":"https://doi.org/10.1201/9781351236423-10","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Handbook of Approximation Algorithms and Metaheuristics, Second Edition","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W2145028977"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W91521151"],"abstract_inverted_index":{"This":[0],"chapter":[1,28,103],"illustrates":[2],"the":[3,14,20,34,55,67,84,100,146],"concept":[4],"of":[5,13,19,38,59,86],"asymptotic":[6,117],"polynomial-time":[7,40,68],"approximation":[8,41,60,69,118,127],"schemes":[9,42,70],"via":[10],"a":[11,107],"study":[12,37,56],"bin":[15,114],"packing":[16,115],"problem.":[17],"Many":[18],"algorithmic":[21,45],"and":[22,36,46,57,89,116],"analytical":[23],"techniques":[24],"described":[25],"in":[26,33,99],"this":[27],"can":[29],"be":[30],"applied":[31],"elsewhere":[32],"development":[35,58],"other":[39,122],"(PTASs).":[43],"The":[44,62,80,102],"analytic":[47],"tools":[48],"demonstrated":[49],"here":[50],"are":[51,121,138],"widely":[52],"applicable":[53],"to":[54,96,113,133],"schemes.":[61,119],"final":[63],"ingredient":[64],"needed":[65],"for":[66],"(AFPTAS,":[71],"APTAS)":[72],"is":[73,93],"called":[74],"interval":[75],"partitioning":[76],"or":[77],"linear":[78],"grouping.":[79],"basic":[81],"idea":[82],"behind":[83],"AFPTAS":[85],"N.":[87],"Karmakar":[88],"R.":[90],"M.":[91],"Karp":[92],"very":[94],"similar":[95],"that":[97,124,129],"used":[98],"APTAS.":[101],"concludes":[104],"by":[105],"presenting":[106],"literature":[108],"survey":[109],"on":[110],"topics":[111],"related":[112],"There":[120],"problems":[123],"admit":[125],"absolute":[126],"algorithms,":[128],"is,":[130],"algorithms":[131],"guaranteed":[132],"produce":[134],"solutions":[135],"whose":[136],"costs":[137],"at":[139],"most":[140],"an":[141],"additive":[142],"constant":[143],"away":[144],"from":[145],"optimal.":[147]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}