{"id":"https://openalex.org/W1975510914","doi":"https://doi.org/10.1007/s10878-006-9023-7","title":"Improved approximation algorithms for metric MaxTSP","display_name":"Improved approximation algorithms for metric MaxTSP","publication_year":2006,"publication_date":"2006-12-07","ids":{"openalex":"https://openalex.org/W1975510914","doi":"https://doi.org/10.1007/s10878-006-9023-7","mag":"1975510914"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-006-9023-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-006-9023-7","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","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/A5101483230","display_name":"Zhi\u2010Zhong Chen","orcid":"https://orcid.org/0000-0003-3061-1171"},"institutions":[{"id":"https://openalex.org/I165522056","display_name":"Tokyo Denki University","ror":"https://ror.org/01pa62v70","country_code":"JP","type":"education","lineage":["https://openalex.org/I165522056"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Zhi-Zhong Chen","raw_affiliation_strings":["Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, Saitama, 350-0394, Japan","TOKYO DENKI UNIVERSITY"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, Saitama, 350-0394, Japan","institution_ids":["https://openalex.org/I165522056"]},{"raw_affiliation_string":"TOKYO DENKI UNIVERSITY","institution_ids":["https://openalex.org/I165522056"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058601758","display_name":"Takayuki Nagoya","orcid":null},"institutions":[{"id":"https://openalex.org/I165522056","display_name":"Tokyo Denki University","ror":"https://ror.org/01pa62v70","country_code":"JP","type":"education","lineage":["https://openalex.org/I165522056"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takayuki Nagoya","raw_affiliation_strings":["Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, Saitama, 350-0394, Japan","TOKYO DENKI UNIVERSITY"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, Saitama, 350-0394, Japan","institution_ids":["https://openalex.org/I165522056"]},{"raw_affiliation_string":"TOKYO DENKI UNIVERSITY","institution_ids":["https://openalex.org/I165522056"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101483230"],"corresponding_institution_ids":["https://openalex.org/I165522056"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":2.0282,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.85655536,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"13","issue":"4","first_page":"321","last_page":"336"},"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.9998000264167786,"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.9998000264167786,"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.9994000196456909,"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/T12288","display_name":"Optimization and Search Problems","score":0.9976999759674072,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.8023444414138794},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7197132706642151},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7156935930252075},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6739851236343384},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5972645282745361},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5672267079353333},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4694212079048157},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4210388958454132},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.41588589549064636},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36003077030181885},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.20377296209335327}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.8023444414138794},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7197132706642151},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7156935930252075},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6739851236343384},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5972645282745361},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5672267079353333},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4694212079048157},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4210388958454132},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.41588589549064636},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36003077030181885},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.20377296209335327},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-006-9023-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-006-9023-7","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:13:y:2007:i:4:d:10.1007_s10878-006-9023-7","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-006-9023-7","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.5199999809265137,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1508325738","https://openalex.org/W1981234161","https://openalex.org/W2017314050","https://openalex.org/W2054136337","https://openalex.org/W2069381123","https://openalex.org/W2130200244","https://openalex.org/W2610479830","https://openalex.org/W2610729871"],"related_works":["https://openalex.org/W1524816531","https://openalex.org/W2054136337","https://openalex.org/W2412601017","https://openalex.org/W4281386767","https://openalex.org/W1975510914","https://openalex.org/W2339467131","https://openalex.org/W4252495556","https://openalex.org/W2056155690","https://openalex.org/W3119173924","https://openalex.org/W2915860730"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}