{"id":"https://openalex.org/W2146197411","doi":"https://doi.org/10.1007/3-540-46521-9_7","title":"Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem","display_name":"Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2146197411","doi":"https://doi.org/10.1007/3-540-46521-9_7","mag":"2146197411"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-46521-9_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-46521-9_7","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","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/A5086921684","display_name":"Hans-Joachim B\u00f6ckenhauer","orcid":"https://orcid.org/0000-0001-9164-3674"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Hans-Joachim B\u00f6ckenhauer","raw_affiliation_strings":["Dept. of Computer Science I (Algorithms and Complexity), RWTH Aachen, Ahornstra\u00dfe 55, 52056, Aachen, Germany","Rwth Aachen"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science I (Algorithms and Complexity), RWTH Aachen, Ahornstra\u00dfe 55, 52056, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]},{"raw_affiliation_string":"Rwth Aachen","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088678782","display_name":"Juraj Hromkovi\u010d","orcid":"https://orcid.org/0000-0001-9754-7042"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Juraj Hromkovi\u010d","raw_affiliation_strings":["Dept. of Computer Science I (Algorithms and Complexity), RWTH Aachen, Ahornstra\u00dfe 55, 52056, Aachen, Germany","Rwth Aachen"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science I (Algorithms and Complexity), RWTH Aachen, Ahornstra\u00dfe 55, 52056, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]},{"raw_affiliation_string":"Rwth Aachen","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Ralf Klasing","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ralf Klasing","raw_affiliation_strings":["Dept. of Computer Science I (Algorithms and Complexity), RWTH Aachen, Ahornstra\u00dfe 55, 52056, Aachen, Germany","Rwth Aachen"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science I (Algorithms and Complexity), RWTH Aachen, Ahornstra\u00dfe 55, 52056, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]},{"raw_affiliation_string":"Rwth Aachen","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045896053","display_name":"Sebastian Seibert","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sebastian Seibert","raw_affiliation_strings":["Dept. of Computer Science I (Algorithms and Complexity), RWTH Aachen, Ahornstra\u00dfe 55, 52056, Aachen, Germany","Rwth Aachen"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science I (Algorithms and Complexity), RWTH Aachen, Ahornstra\u00dfe 55, 52056, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]},{"raw_affiliation_string":"Rwth Aachen","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":null,"display_name":"Walter Unger","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Walter Unger","raw_affiliation_strings":["Dept. of Computer Science I (Algorithms and Complexity), RWTH Aachen, Ahornstra\u00dfe 55, 52056, Aachen, Germany","Rwth Aachen"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science I (Algorithms and Complexity), RWTH Aachen, Ahornstra\u00dfe 55, 52056, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]},{"raw_affiliation_string":"Rwth Aachen","institution_ids":["https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5086921684"],"corresponding_institution_ids":["https://openalex.org/I887968799"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.2433,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.88082058,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"72","last_page":"86"},"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.7353000044822693,"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.7353000044822693,"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.08879999816417694,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.04839999973773956,"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.8524479866027832},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7013254761695862},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.6576350331306458},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"Triangle inequality","score":0.6435579061508179},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6181156635284424},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5211553573608398},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.515682578086853},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46184155344963074},{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","score":0.4453347325325012},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.34741559624671936},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.309937983751297},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27890557050704956},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1533280313014984},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.06664729118347168}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8524479866027832},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7013254761695862},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.6576350331306458},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.6435579061508179},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6181156635284424},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5211553573608398},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.515682578086853},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46184155344963074},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.4453347325325012},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.34741559624671936},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.309937983751297},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27890557050704956},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1533280313014984},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.06664729118347168},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/3-540-46521-9_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-46521-9_7","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.29.4179","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.4179","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/1999/TR99-031/pub/eccc/reports/1999/TR99-031/Paper.ps","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00307016v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00307016","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theoretical Computer Science, 2002, 285 (1), pp.3--24","raw_type":"Journal articles"},{"id":"pmh:oai:oskar-bordeaux.fr:20.500.12278/198729","is_oa":false,"landing_page_url":"https://oskar-bordeaux.fr/handle/20.500.12278/198729","pdf_url":null,"source":{"id":"https://openalex.org/S4306402569","display_name":"Oskar-Bordeaux (Universite de Bordeaux)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"},{"id":"pmh:oai:publications.rwth-aachen.de:152211","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/152211","pdf_url":null,"source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"4. Italian Conference on Algorithms and Complexity, CIAC 2000, Rome, Italy, 2000-03-01 - 2000-03-03","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:publications.rwth-aachen.de:197895","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/197895","pdf_url":null,"source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms and complexity : 4th Italian conference, CIAC 2000, Rome, Italy, March 1 - 3, 2000 ; proceedings / Giancarlo Bongiovanni ... (eds.)<br/>4. Italian conference, CIAC 2000, Rome, Italy, 2000-03-01 - 2000-03-03","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4000000059604645,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1508890431","https://openalex.org/W1527658885","https://openalex.org/W1590668015","https://openalex.org/W1990313671","https://openalex.org/W2026891055","https://openalex.org/W2036265926","https://openalex.org/W2043097561","https://openalex.org/W2055569927","https://openalex.org/W2141355868","https://openalex.org/W2163322487","https://openalex.org/W2165142526","https://openalex.org/W4232911940","https://openalex.org/W6600747648","https://openalex.org/W6631722374"],"related_works":["https://openalex.org/W4200179302","https://openalex.org/W1595757466","https://openalex.org/W2766731260","https://openalex.org/W3210931532","https://openalex.org/W2620231896","https://openalex.org/W1645834615","https://openalex.org/W87675801","https://openalex.org/W2171568915","https://openalex.org/W2055574289","https://openalex.org/W2038858023"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}