{"id":"https://openalex.org/W16097939","doi":null,"title":"On Approximation Preserving Reductions: Complete Problems and Robust Measures (Revised Version)","display_name":"On Approximation Preserving Reductions: Complete Problems and Robust Measures (Revised Version)","publication_year":1990,"publication_date":"1990-01-01","ids":{"openalex":"https://openalex.org/W16097939","mag":"16097939"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.9.8643","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.8643","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.tcs.hut.fi/~orponen/papers/approx.ps.gz","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/A5058753686","display_name":"Pekka Orponen","orcid":"https://orcid.org/0000-0002-0417-2104","observed_orcids":["https://orcid.org/0000-0002-0417-2104"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pekka Orponen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5013005096","display_name":"Heikki Mannila","orcid":"https://orcid.org/0009-0000-3772-6073","observed_orcids":["https://orcid.org/0009-0000-3772-6073","https://orcid.org/0000-0003-1339-8022"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Heikki Mannila","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":10,"citation_normalized_percentile":{"value":0.00192596,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":96},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9984999895095825,"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.9984999895095825,"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.0010000000474974513,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/approximation-preserving-reductions","display_name":"approximation-preserving reductions","score":0.8989999890327454},{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.9490000009536743},{"id":"https://openalex.org/keywords/zero-one-programming","display_name":"zero-one integer programming","score":0.9950000047683716},{"id":"https://openalex.org/keywords/invertible-transformations","display_name":"invertible transformations","score":0.6840000152587891},{"id":"https://openalex.org/keywords/polynomial-time-reduction","display_name":"polynomial-time reduction","score":0.5120000243186951}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6864297389984131},{"id":"https://openalex.org/C96442724","wikidata":"https://www.wikidata.org/wiki/Q242188","display_name":"Invertible matrix","level":2,"score":0.57956862449646},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5446961522102356},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5379778146743774},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.523386538028717},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5220451354980469},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4897611141204834},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4883587062358856},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.4660782516002655},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4531850516796112},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4281187653541565},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4173535704612732},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4115932881832123},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3176482617855072},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22312983870506287},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.9.8643","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.8643","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.tcs.hut.fi/~orponen/papers/approx.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W176350590","https://openalex.org/W1510300750","https://openalex.org/W1608772366","https://openalex.org/W1636637297","https://openalex.org/W1972345639","https://openalex.org/W1975218943","https://openalex.org/W2005097301","https://openalex.org/W2011039300","https://openalex.org/W2015092796","https://openalex.org/W2036265926","https://openalex.org/W2038225707","https://openalex.org/W2053913299","https://openalex.org/W2056090079","https://openalex.org/W2072181151","https://openalex.org/W2086917808","https://openalex.org/W2086942674","https://openalex.org/W2090186532","https://openalex.org/W2123068254","https://openalex.org/W2489890685"],"related_works":["https://openalex.org/W7100414592","https://openalex.org/W2150636758","https://openalex.org/W2040579873","https://openalex.org/W7099433456","https://openalex.org/W2011285766","https://openalex.org/W202443291","https://openalex.org/W3209546412","https://openalex.org/W2050896380","https://openalex.org/W7100519318","https://openalex.org/W6941101366"],"abstract_inverted_index":{"We":[0,14,38],"investigate":[1],"the":[2,7,46,49,54,67,76,80],"well-known":[3],"anomalous":[4],"differences":[5],"in":[6,60,90],"approximability":[8],"properties":[9],"of":[10,18,35,45,69,115],"NP-complete":[11],"optimization":[12,23],"problems.":[13,72],"define":[15],"a":[16,42,61,97],"notion":[17],"polynomial":[19],"time":[20],"reduction":[21],"between":[22],"problems,":[24],"and":[25,53,95],"introduce":[26],"conditions":[27],"guaranteeing":[28],"that":[29,41,78,104],"such":[30],"reductions":[31],"preserve":[32],"various":[33],"types":[34],"approximate":[36],"solutions.":[37],"then":[39],"prove":[40],"weighted":[43],"version":[44],"satisfiability":[47],"problem,":[48,52],"traveling":[50],"salesperson":[51],"zero-one":[55],"integer":[56],"programming":[57],"problem":[58,93],"are":[59,105],"strong":[62],"sense":[63],"approximation":[64,84],"complete":[65],"for":[66,100],"class":[68,114],"NP":[70],"minimization":[71],"Finally,":[73],"we":[74],"discuss":[75],"reasons":[77],"cause":[79],"standard":[81],"relative":[82],"error":[83],"quality":[85,102],"measure":[86],"to":[87,110],"break":[88],"down":[89],"computationally":[91],"simple":[92],"transformations,":[94],"give":[96],"general":[98],"construction":[99],"producing":[101],"measures":[103],"more":[106],"robust":[107],"with":[108],"respect":[109],"an":[111],"arbitrary":[112],"given":[113],"invertible":[116],"transformations.":[117]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-11-05T12:25:35.769452","created_date":"2025-10-27T00:00:00"}