{"id":"https://openalex.org/W3003767193","doi":"https://doi.org/10.1109/indin41052.2019.8972232","title":"Predicting the difficulty of TSP instances using MST","display_name":"Predicting the difficulty of TSP instances using MST","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W3003767193","doi":"https://doi.org/10.1109/indin41052.2019.8972232","mag":"3003767193"},"language":"en","primary_location":{"id":"doi:10.1109/indin41052.2019.8972232","is_oa":false,"landing_page_url":"https://doi.org/10.1109/indin41052.2019.8972232","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 17th International Conference on Industrial Informatics (INDIN)","raw_type":"proceedings-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/A5075845388","display_name":"Lahari Sengupta","orcid":"https://orcid.org/0000-0002-5265-6728"},"institutions":[{"id":"https://openalex.org/I175532246","display_name":"University of Eastern Finland","ror":"https://ror.org/00cyydd11","country_code":"FI","type":"education","lineage":["https://openalex.org/I175532246"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"Lahari Sengupta","raw_affiliation_strings":["University of Eastern Finland,School of Computing,Joensuu,Finland","School of Computing, University of Eastern Finland, Joensuu, Finland"],"affiliations":[{"raw_affiliation_string":"University of Eastern Finland,School of Computing,Joensuu,Finland","institution_ids":["https://openalex.org/I175532246"]},{"raw_affiliation_string":"School of Computing, University of Eastern Finland, Joensuu, Finland","institution_ids":["https://openalex.org/I175532246"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037846871","display_name":"Pasi Fr\u00e4nti","orcid":"https://orcid.org/0000-0002-9554-2827"},"institutions":[{"id":"https://openalex.org/I175532246","display_name":"University of Eastern Finland","ror":"https://ror.org/00cyydd11","country_code":"FI","type":"education","lineage":["https://openalex.org/I175532246"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Pasi Fr\u00e4nti","raw_affiliation_strings":["University of Eastern Finland,School of Computing,Joensuu,Finland","School of Computing, University of Eastern Finland, Joensuu, Finland"],"affiliations":[{"raw_affiliation_string":"University of Eastern Finland,School of Computing,Joensuu,Finland","institution_ids":["https://openalex.org/I175532246"]},{"raw_affiliation_string":"School of Computing, University of Eastern Finland, Joensuu, Finland","institution_ids":["https://openalex.org/I175532246"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075845388"],"corresponding_institution_ids":["https://openalex.org/I175532246"],"apc_list":null,"apc_paid":null,"fwci":0.7074,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.74814895,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"847","last_page":"852"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9950000047683716,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9950000047683716,"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"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9901000261306763,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9853000044822693,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8124830722808838},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6341216564178467},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.572323203086853},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5505191087722778},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.514146625995636},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.477138489484787},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4570602774620056},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42556583881378174},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3489627242088318},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34597980976104736},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32701021432876587},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3193899989128113},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.14712277054786682}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8124830722808838},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6341216564178467},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.572323203086853},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5505191087722778},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.514146625995636},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.477138489484787},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4570602774620056},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42556583881378174},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3489627242088318},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34597980976104736},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32701021432876587},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3193899989128113},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.14712277054786682}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/indin41052.2019.8972232","is_oa":false,"landing_page_url":"https://doi.org/10.1109/indin41052.2019.8972232","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 17th International Conference on Industrial Informatics (INDIN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.5099999904632568,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W626292722","https://openalex.org/W1839890369","https://openalex.org/W1965680834","https://openalex.org/W1973415219","https://openalex.org/W2009648120","https://openalex.org/W2017927472","https://openalex.org/W2026522103","https://openalex.org/W2043751102","https://openalex.org/W2048264783","https://openalex.org/W2059427048","https://openalex.org/W2084642062","https://openalex.org/W2092439775","https://openalex.org/W2107631919","https://openalex.org/W2117210019","https://openalex.org/W2142092204","https://openalex.org/W2748310782","https://openalex.org/W2902812507","https://openalex.org/W2946046356","https://openalex.org/W3145128584","https://openalex.org/W4255306344"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W2044443696","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181","https://openalex.org/W2051378252"],"abstract_inverted_index":{"The":[0,39],"efforts":[1],"needed":[2],"to":[3,74],"solve":[4,75],"travelling":[5],"salesman":[6],"problems":[7],"(TSP)":[8],"obviously":[9],"depend":[10],"on":[11,33],"the":[12,21,34,42,49,59,65,67,70],"problem":[13,26,71],"size.":[14],"However,":[15],"also":[16],"other":[17],"factors":[18],"can":[19],"predict":[20],"difficulty":[22],"of":[23,44],"a":[24,30],"given":[25],"instance.":[27],"We":[28,54],"present":[29],"measure":[31,40],"based":[32],"minimum":[35],"spanning":[36],"tree":[37,50],"(MST).":[38],"counts":[41],"number":[43],"knot":[45],"points,":[46],"which":[47],"branch":[48],"into":[51],"multiple":[52],"sub-trees.":[53],"show":[55],"by":[56,76],"experiments":[57],"that":[58],"more":[60,68],"there":[61],"are":[62],"knots":[63],"in":[64],"tree,":[66],"difficult":[69],"instance":[72],"is":[73],"both":[77],"humans":[78],"and":[79],"computers.":[80]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}