{"id":"https://openalex.org/W2693776469","doi":null,"title":"Approximation Algorithms for NP-problems","display_name":"Approximation Algorithms for NP-problems","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2693776469","mag":"2693776469"},"language":"en","primary_location":{"id":"mag:2693776469","doi":null,"is_oa":false,"landing_page_url":"https://www.ciitresearch.org/dl/index.php/aa/article/view/AA052009001","pdf_url":null,"source":{"id":"https://openalex.org/S2764438868","display_name":"Automation and Autonomous Systems","issn_l":"0974-9659","issn":["0974-9659","0974-9551"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Automation and Autonomous Systems","raw_type":null},"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/A5088334194","display_name":"Narendhar Maaroju","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Narendhar Maaroju","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078000737","display_name":"Kamlesh Kumar","orcid":"https://orcid.org/0000-0003-1444-6049","observed_orcids":["https://orcid.org/0000-0003-1444-6049"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kamlesh Kumar","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-1444-6049","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5080945795","display_name":"Deepak Garg","orcid":"https://orcid.org/0000-0002-7243-3599","observed_orcids":["https://orcid.org/0000-0002-7243-3599","https://orcid.org/0000-0001-8725-1838"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Deepak Garg","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-7243-3599","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":1,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":"1","issue":"2","first_page":"35","last_page":"41"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.0005000000237487257,"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/T11269","display_name":"Algorithms and Data Compression","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":1.0},{"id":"https://openalex.org/keywords/np-hard-problems","display_name":"NP-hard problems","score":0.9599999785423279},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.8130000233650208},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.5590000152587891},{"id":"https://openalex.org/keywords/set-cover","display_name":"set cover","score":0.8209999799728394},{"id":"https://openalex.org/keywords/matching","display_name":"matching","score":0.8500000238418579},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"graph coloring","score":0.9950000047683716},{"id":"https://openalex.org/keywords/multiple-sequence-alignment","display_name":"multiple sequence alignment","score":0.984000027179718},{"id":"https://openalex.org/keywords/computational-biology","display_name":"computational biology","score":0.9259999990463257},{"id":"https://openalex.org/keywords/nearly-linear-time-algorithms","display_name":"near-linear time algorithms","score":0.7260000109672546},{"id":"https://openalex.org/keywords/intractability","display_name":"computational intractability","score":0.7820000052452087}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5767266154289246},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5598585605621338},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5581938624382019},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5156546831130981},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5126785039901733},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49584874510765076},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48626434803009033},{"id":"https://openalex.org/C19754495","wikidata":"https://www.wikidata.org/wiki/Q3435924","display_name":"Computational problem","level":2,"score":0.47572997212409973},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.44524097442626953},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.43789321184158325},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43254905939102173},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40450698137283325},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3919001519680023},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30533674359321594},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2693776469","doi":null,"is_oa":false,"landing_page_url":"https://www.ciitresearch.org/dl/index.php/aa/article/view/AA052009001","pdf_url":null,"source":{"id":"https://openalex.org/S2764438868","display_name":"Automation and Autonomous Systems","issn_l":"0974-9659","issn":["0974-9659","0974-9551"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Automation and Autonomous Systems","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":0,"referenced_works":[],"related_works":["https://openalex.org/W7099149909","https://openalex.org/W2950905676","https://openalex.org/W2133668753","https://openalex.org/W7099058255","https://openalex.org/W7096481667","https://openalex.org/W2626895439","https://openalex.org/W7026635939","https://openalex.org/W7097951413","https://openalex.org/W2079473728","https://openalex.org/W4206878156"],"abstract_inverted_index":{"Algorithms":[0],"are":[1,29,76],"at":[2],"the":[3,58,61,93],"heart":[4],"of":[5,57,60,95],"problem":[6],"solving":[7],"in\u00a0scientific":[8],"computing":[9],"and":[10,82,101,121],"computer":[11],"science.":[12],"Unfortunately":[13],"many":[14],"of\u00a0the":[15],"combinatorial":[16,102],"problems":[17,103],"that":[18,26,48,72,104],"arise":[19,106],"in":[20,65,107],"a":[21],"computational":[22,110,125],"context":[23],"are\u00a0NP-hard,":[24],"so":[25],"optimal":[27],"solutions":[28,75],"unlikely":[30],"to":[31,45,52,79],"be":[32,53,80],"found":[33],"in\u00a0polynomial":[34],"time.":[35],"How":[36],"can":[37],"we":[38],"cope":[39],"with":[40],"this":[41],"intractability?":[42],"One\u00a0approach":[43],"is":[44],"design":[46,94],"algorithms":[47,71,97],"find":[49,73],"approximate":[50],"solutions\u00a0guaranteed":[51],"within":[54],"some":[55],"factor":[56],"quality":[59],"optimal\u00a0solution.":[62],"More":[63],"recently,":[64],"large-scale":[66],"scientific":[67,108],"computing,":[68],"even\u00a0polynomial":[69],"time":[70],"exact":[74],"deemed":[77],"too\u00a0expensive":[78],"practical,":[81],"one":[83],"needs":[84],"faster":[85],"(nearly":[86],"linear":[87],"time)approximation":[88],"algorithms.":[89],"We":[90],"will":[91],"consider":[92],"approximation":[96],"for":[98],"various":[99],"graph-theoretical":[100],"commonly":[105],"computing\u00a0and":[109],"biology.":[111,126],"These":[112],"include":[113],"set":[114],"covers":[115,117],"(vertex":[116],"in\u00a0hypergraphs),":[118],"matching,":[119],"coloring,":[120],"multiple":[122],"sequence":[123],"alignments\u00a0in":[124]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2017-06-30T00:00:00"}