{"id":"https://openalex.org/W2057902451","doi":"https://doi.org/10.1007/bf02187869","title":"A polynomial-time linear decision tree for the traveling salesman problem and other NP-complete problems","display_name":"A polynomial-time linear decision tree for the traveling salesman problem and other NP-complete problems","publication_year":1987,"publication_date":"1987-03-01","ids":{"openalex":"https://openalex.org/W2057902451","doi":"https://doi.org/10.1007/bf02187869","mag":"2057902451"},"language":"en","primary_location":{"id":"doi:10.1007/bf02187869","is_oa":true,"landing_page_url":"https://doi.org/10.1007/bf02187869","pdf_url":"https://link.springer.com/content/pdf/10.1007/BF02187869.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"Discrete & Computational Geometry","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/BF02187869.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028423394","display_name":"Martin Kolinek","orcid":null},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Martin Kolinek","raw_affiliation_strings":["Department of Mathematics, University of Washington, 98195, Seattle, WA, USA","Department of Mathematics, University of Washington, Seattle, USA 98195"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Washington, 98195, Seattle, WA, USA","institution_ids":["https://openalex.org/I201448701"]},{"raw_affiliation_string":"Department of Mathematics, University of Washington, Seattle, USA 98195","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028423394"],"corresponding_institution_ids":["https://openalex.org/I201448701"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.21978799,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2","issue":"1","first_page":"37","last_page":"48"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9883999824523926,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9835000038146973,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8637391328811646},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7832876443862915},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6203020215034485},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5610706210136414},{"id":"https://openalex.org/keywords/hyperplane","display_name":"Hyperplane","score":0.5577185153961182},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5115626454353333},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.5089669227600098},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.48948466777801514},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.46622776985168457},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42109447717666626},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38916879892349243},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.300376296043396},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19422000646591187},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15262466669082642},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07619473338127136}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8637391328811646},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7832876443862915},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6203020215034485},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5610706210136414},{"id":"https://openalex.org/C68693459","wikidata":"https://www.wikidata.org/wiki/Q657586","display_name":"Hyperplane","level":2,"score":0.5577185153961182},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5115626454353333},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.5089669227600098},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.48948466777801514},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.46622776985168457},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42109447717666626},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38916879892349243},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.300376296043396},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19422000646591187},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15262466669082642},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07619473338127136},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf02187869","is_oa":true,"landing_page_url":"https://doi.org/10.1007/bf02187869","pdf_url":"https://link.springer.com/content/pdf/10.1007/BF02187869.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"Discrete & Computational Geometry","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/bf02187869","is_oa":true,"landing_page_url":"https://doi.org/10.1007/bf02187869","pdf_url":"https://link.springer.com/content/pdf/10.1007/BF02187869.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"Discrete & Computational Geometry","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.550000011920929,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2057902451.pdf","grobid_xml":"https://content.openalex.org/works/W2057902451.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W1514650040","https://openalex.org/W2011039300","https://openalex.org/W2028627293","https://openalex.org/W2115855203","https://openalex.org/W2136095047","https://openalex.org/W2140515217","https://openalex.org/W2150121468"],"related_works":["https://openalex.org/W4376138746","https://openalex.org/W4389782626","https://openalex.org/W2361554335","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W2359992618","https://openalex.org/W4200179302","https://openalex.org/W4309336419","https://openalex.org/W2620231896","https://openalex.org/W2946024655"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}