{"id":"https://openalex.org/W4213233858","doi":"https://doi.org/10.3390/a15020064","title":"Accelerate Incremental TSP Algorithms on Time Evolving Graphs with Partitioning Methods","display_name":"Accelerate Incremental TSP Algorithms on Time Evolving Graphs with Partitioning Methods","publication_year":2022,"publication_date":"2022-02-14","ids":{"openalex":"https://openalex.org/W4213233858","doi":"https://doi.org/10.3390/a15020064"},"language":"en","primary_location":{"id":"doi:10.3390/a15020064","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15020064","pdf_url":"https://www.mdpi.com/1999-4893/15/2/64/pdf?version=1645074871","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/15/2/64/pdf?version=1645074871","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004116435","display_name":"Shalini Sharma","orcid":"https://orcid.org/0000-0002-0039-8878"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Shalini Sharma","raw_affiliation_strings":["Institute of Information System and Applications, National Tsing Hua University, Hsinchu City 300, Taiwan"],"affiliations":[{"raw_affiliation_string":"Institute of Information System and Applications, National Tsing Hua University, Hsinchu City 300, Taiwan","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005498754","display_name":"Jerry Chou","orcid":"https://orcid.org/0000-0001-7851-1140"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Jerry Chou","raw_affiliation_strings":["Institute of Information System and Applications, National Tsing Hua University, Hsinchu City 300, Taiwan"],"affiliations":[{"raw_affiliation_string":"Institute of Information System and Applications, National Tsing Hua University, Hsinchu City 300, Taiwan","institution_ids":["https://openalex.org/I25846049"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005498754"],"corresponding_institution_ids":["https://openalex.org/I25846049"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.2975,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.4720209,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"15","issue":"2","first_page":"64","last_page":"64"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9995999932289124,"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.9995999932289124,"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.9991999864578247,"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.9947999715805054,"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.7167739868164062},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6071974039077759},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5643648505210876},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5484384894371033},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5378230214118958},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.5092648267745972},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4894005358219147},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4854148328304291},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.435698002576828},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41935068368911743}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7167739868164062},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6071974039077759},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5643648505210876},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5484384894371033},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5378230214118958},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.5092648267745972},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4894005358219147},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4854148328304291},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.435698002576828},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41935068368911743}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a15020064","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15020064","pdf_url":"https://www.mdpi.com/1999-4893/15/2/64/pdf?version=1645074871","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:89a8742f95fb4bc382184272c0dd27ea","is_oa":true,"landing_page_url":"https://doaj.org/article/89a8742f95fb4bc382184272c0dd27ea","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 15, Iss 2, p 64 (2022)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/15/2/64/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a15020064","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 15; Issue 2; Pages: 64","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a15020064","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15020064","pdf_url":"https://www.mdpi.com/1999-4893/15/2/64/pdf?version=1645074871","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4213233858.pdf","grobid_xml":"https://content.openalex.org/works/W4213233858.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W78077100","https://openalex.org/W1492852957","https://openalex.org/W1969970763","https://openalex.org/W1977749252","https://openalex.org/W2003362605","https://openalex.org/W2006023152","https://openalex.org/W2017052626","https://openalex.org/W2017330138","https://openalex.org/W2024060531","https://openalex.org/W2038287544","https://openalex.org/W2042986967","https://openalex.org/W2051579561","https://openalex.org/W2084243923","https://openalex.org/W2089196696","https://openalex.org/W2101029682","https://openalex.org/W2107941094","https://openalex.org/W2142491343","https://openalex.org/W2153245628","https://openalex.org/W2196885578","https://openalex.org/W2407549107","https://openalex.org/W2527771315","https://openalex.org/W2557378401","https://openalex.org/W2713119698","https://openalex.org/W2774090050","https://openalex.org/W2798467024","https://openalex.org/W3012164347","https://openalex.org/W3023464740","https://openalex.org/W3041758129","https://openalex.org/W3136290055","https://openalex.org/W3195737000","https://openalex.org/W3200159217","https://openalex.org/W3201009086","https://openalex.org/W3214850474","https://openalex.org/W4236605548","https://openalex.org/W6682642761","https://openalex.org/W6740694449","https://openalex.org/W6838474342"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W2054495636","https://openalex.org/W4306878646","https://openalex.org/W2164188042","https://openalex.org/W3139829055","https://openalex.org/W2583811263","https://openalex.org/W3211941742","https://openalex.org/W2035944803"],"abstract_inverted_index":{"In":[0,51],"time-evolving":[1],"graphs,":[2],"the":[3,11,22,37,43,48,58,76,84,88,93,104,109],"graph":[4],"changes":[5],"at":[6],"each":[7,119],"time":[8],"interval,":[9],"and":[10,31,71],"previously":[12],"computed":[13,41],"results":[14],"become":[15],"invalid.":[16],"We":[17,80],"addressed":[18],"this":[19],"issue":[20],"for":[21],"traveling":[23],"salesman":[24],"problem":[25,60],"(TSP)":[26],"in":[27,118],"our":[28,52,98],"previous":[29,44],"work":[30],"proposed":[32],"an":[33],"incremental":[34],"algorithm":[35],"where":[36],"TSP":[38,59,77],"tour":[39,78],"is":[40],"from":[42],"result":[45],"instead":[46],"of":[47,86,90,112,116],"whole":[49],"graph.":[50],"current":[53],"work,":[54],"we":[55,74,100],"have":[56,81,101],"mapped":[57],"to":[61],"three":[62],"partitioning":[63],"methods":[64],"named":[65],"vertex":[66,105],"size":[67,106],"attribute,":[68,70],"edge":[69],"k-means;":[72],"then,":[73],"compared":[75],"results.":[79],"also":[82],"examined":[83],"effect":[85],"increasing":[87],"number":[89,115],"partitions":[91],"on":[92],"total":[94],"computation":[95],"time.":[96],"Through":[97],"experiments,":[99],"observed":[102],"that":[103],"attribute":[107],"performs":[108],"best":[110],"because":[111],"a":[113],"balanced":[114],"vertices":[117],"partition.":[120]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2022-02-24T00:00:00"}