{"id":"https://openalex.org/W1520111182","doi":"https://doi.org/10.1007/s10107-003-0438-y","title":"Approximation schemes for NP-hard geometric optimization problems: a survey","display_name":"Approximation schemes for NP-hard geometric optimization problems: a survey","publication_year":2003,"publication_date":"2003-07-01","ids":{"openalex":"https://openalex.org/W1520111182","doi":"https://doi.org/10.1007/s10107-003-0438-y","mag":"1520111182"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-003-0438-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-003-0438-y","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-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/A5103209777","display_name":"Sanjeev Arora","orcid":"https://orcid.org/0000-0003-4852-691X"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sanjeev Arora","raw_affiliation_strings":["Computer Science Department, Princeton University, 35 Olden St, Princeton NJ 08544, e-mail: arora@cs.princeton.edu, , , , ,","Computer Science Department, Princeton University, 35 Olden St, Princeton NJ 08544, e-mail: arora@cs.princeton.edu,"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Princeton University, 35 Olden St, Princeton NJ 08544, e-mail: arora@cs.princeton.edu, , , , ,","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Computer Science Department, Princeton University, 35 Olden St, Princeton NJ 08544, e-mail: arora@cs.princeton.edu,","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103209777"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":6.7002,"has_fulltext":false,"cited_by_count":139,"citation_normalized_percentile":{"value":0.96269279,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"97","issue":"1","first_page":"43","last_page":"69"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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.9973000288009644,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6888223886489868},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6778693795204163},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6200414299964905},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.59445720911026},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5412276983261108},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5126103758811951},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4994637966156006},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3585318326950073},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3218218684196472}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6888223886489868},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6778693795204163},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6200414299964905},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.59445720911026},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5412276983261108},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5126103758811951},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4994637966156006},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3585318326950073},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3218218684196472}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s10107-003-0438-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-003-0438-y","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.122.337","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.122.337","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cit.gu.edu.au/~s2130677/teaching/AlgEng/READINGS/ApproximationSchemes/arorageo.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.16.4784","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.4784","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.princeton.edu/~arora/pubs/arorageo.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.335.3235","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.335.3235","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.duke.edu/courses/spring07/cps296.2/scribe_notes/arorageo.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.404.2992","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.404.2992","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.tau.ac.il/~michas/arorageo.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":71,"referenced_works":["https://openalex.org/W80909727","https://openalex.org/W201222650","https://openalex.org/W307896644","https://openalex.org/W1515796352","https://openalex.org/W1527583442","https://openalex.org/W1535706250","https://openalex.org/W1556839242","https://openalex.org/W1556911662","https://openalex.org/W1566313961","https://openalex.org/W1600533941","https://openalex.org/W1601649239","https://openalex.org/W1714357736","https://openalex.org/W1727362095","https://openalex.org/W1813896049","https://openalex.org/W1921984393","https://openalex.org/W1966613935","https://openalex.org/W1976222519","https://openalex.org/W1977541023","https://openalex.org/W1982180670","https://openalex.org/W1988706875","https://openalex.org/W1990313671","https://openalex.org/W1992490235","https://openalex.org/W1994048022","https://openalex.org/W2002041206","https://openalex.org/W2004328207","https://openalex.org/W2007052372","https://openalex.org/W2011039300","https://openalex.org/W2011595401","https://openalex.org/W2012130001","https://openalex.org/W2014068360","https://openalex.org/W2020284736","https://openalex.org/W2021659530","https://openalex.org/W2022671649","https://openalex.org/W2026891055","https://openalex.org/W2038225707","https://openalex.org/W2038643780","https://openalex.org/W2043250424","https://openalex.org/W2044379308","https://openalex.org/W2044718761","https://openalex.org/W2047820376","https://openalex.org/W2049413646","https://openalex.org/W2055569927","https://openalex.org/W2062254875","https://openalex.org/W2063836932","https://openalex.org/W2066194644","https://openalex.org/W2070664846","https://openalex.org/W2071323660","https://openalex.org/W2072698009","https://openalex.org/W2074210283","https://openalex.org/W2080600916","https://openalex.org/W2085751730","https://openalex.org/W2086709935","https://openalex.org/W2086917808","https://openalex.org/W2088027604","https://openalex.org/W2089278402","https://openalex.org/W2110367141","https://openalex.org/W2110605075","https://openalex.org/W2133311553","https://openalex.org/W2141815340","https://openalex.org/W2142607374","https://openalex.org/W2143391442","https://openalex.org/W2148352980","https://openalex.org/W2151148851","https://openalex.org/W2156760067","https://openalex.org/W2163428398","https://openalex.org/W2168881041","https://openalex.org/W2476096155","https://openalex.org/W2611804663","https://openalex.org/W2979473749","https://openalex.org/W3148765228","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2087083181","https://openalex.org/W2112839770","https://openalex.org/W2561136735","https://openalex.org/W2165142526","https://openalex.org/W1552851923","https://openalex.org/W1983607113","https://openalex.org/W1991678853","https://openalex.org/W2062254875","https://openalex.org/W4232911940","https://openalex.org/W1520111182"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}