Accelerate Incremental TSP Algorithms on Time Evolving Graphs with Partitioning Methods
In time-evolving graphs, the graph changes at each time interval, and the previously computed results become invalid. We addressed this issue for the traveling salesman problem (TSP) in our previous work and proposed an incremental algorithm where the TSP tour is computed from the previous result in...
Uloženo v:
| Vydáno v: | Algorithms Ročník 15; číslo 2; s. 64 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Basel
MDPI AG
01.02.2022
|
| Témata: | |
| ISSN: | 1999-4893, 1999-4893 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | In time-evolving graphs, the graph changes at each time interval, and the previously computed results become invalid. We addressed this issue for the traveling salesman problem (TSP) in our previous work and proposed an incremental algorithm where the TSP tour is computed from the previous result instead of the whole graph. In our current work, we have mapped the TSP problem to three partitioning methods named vertex size attribute, edge attribute, and k-means; then, we compared the TSP tour results. We have also examined the effect of increasing the number of partitions on the total computation time. Through our experiments, we have observed that the vertex size attribute performs the best because of a balanced number of vertices in each partition. |
|---|---|
| AbstractList | In time-evolving graphs, the graph changes at each time interval, and the previously computed results become invalid. We addressed this issue for the traveling salesman problem (TSP) in our previous work and proposed an incremental algorithm where the TSP tour is computed from the previous result instead of the whole graph. In our current work, we have mapped the TSP problem to three partitioning methods named vertex size attribute, edge attribute, and k-means; then, we compared the TSP tour results. We have also examined the effect of increasing the number of partitions on the total computation time. Through our experiments, we have observed that the vertex size attribute performs the best because of a balanced number of vertices in each partition. |
| Author | Chou, Jerry Sharma, Shalini |
| Author_xml | – sequence: 1 givenname: Shalini orcidid: 0000-0002-0039-8878 surname: Sharma fullname: Sharma, Shalini – sequence: 2 givenname: Jerry surname: Chou fullname: Chou, Jerry |
| BookMark | eNplkVtLAzEQhYMoeH3wHwR88qGay-42eSzipaAoWPExTLOzbcp2U5NY8d-btSqiTxPmnPnmhNkn253vkJBjzs6k1OwceMkEY1WxRfa41npQKC23f713yX6Mi-wodcX3yPPIWmwxQEI67mzAJXYJWjp5fKCjduaDS_NlpL6jE7dEern27dp1M3odYDWP9C3L9AFCcsn5rhfuMM19HQ_JTgNtxKOvekCeri4nFzeD2_vr8cXodmBlqdKgrEU11RYVYyCF5CiYlkI0thkqlCXaxlaiVjith7UY9oIGEBI1ArNacXlAxhtu7WFhVsEtIbwbD858NnyYmT6dbdEoDWpYiEaXzbSYWqkEV0WGWlZnNkJmnWxYq-BfXjEms_Cvocvxjaik4LrMC7PrfOOywccYsDHWJei_nwK41nBm-kuYn0vkidM_E985_3s_AH5jibc |
| CitedBy_id | crossref_primary_10_3390_a16020091 |
| Cites_doi | 10.1371/journal.pone.0123426 10.1016/j.apm.2021.08.030 10.1145/2090236.2090249 10.1145/2339530.2339539 10.1109/TAES.2021.3130830 10.4236/jcc.2016.415009 10.14778/3389133.3389142 10.14778/3157794.3157802 10.1016/0305-0548(75)90015-5 10.1016/j.ast.2021.107053 10.1109/ICNC.2013.6818008 10.1145/3350755.3400255 10.1126/science.220.4598.671 10.1145/2484838.2484843 10.1109/3477.484436 10.1109/BigDataCongress.2016.12 10.1145/2556195.2556213 10.1007/978-1-4419-1153-7_1068 10.1109/BigData.2015.7363735 10.1007/s11227-021-03716-5 10.1049/cp:19951098 10.1007/978-3-030-86271-8_10 10.1145/1062745.1062885 10.1007/978-3-642-16054-7_5 10.1145/1989323.1989420 10.1287/opre.21.2.498 10.1016/j.pnsc.2008.03.028 10.1145/2915516.2915519 10.1109/SWAT.1974.4 10.1007/978-1-4613-0303-9_33 |
| ContentType | Journal Article |
| Copyright | 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | AAYXX CITATION 3V. 7SC 7TB 7XB 8AL 8FD 8FE 8FG 8FK ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO FR3 GNUQQ HCIFZ JQ2 K7- KR7 L6V L7M L~C L~D M0N M7S P62 PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U DOA |
| DOI | 10.3390/a15020064 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials - QC ProQuest Central Database Suite (ProQuest) Technology Collection ProQuest One ProQuest Central Engineering Research Database ProQuest Central Student SciTech Collection (ProQuest) ProQuest Computer Science Collection Computer Science Database Civil Engineering Abstracts ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Engineering Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ProQuest Central Basic DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef Publicly Available Content Database Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Engineering Collection Advanced Technologies & Aerospace Collection Civil Engineering Abstracts ProQuest Computing Engineering Database ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional ProQuest One Academic UKI Edition Materials Science & Engineering Collection Engineering Research Database ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) |
| DatabaseTitleList | Publicly Available Content Database CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1999-4893 |
| ExternalDocumentID | oai_doaj_org_article_89a8742f95fb4bc382184272c0dd27ea 10_3390_a15020064 |
| GroupedDBID | 23M 2WC 5VS 8FE 8FG AADQD AAFWJ AAYXX ABDBF ABJCF ABUWG ACUHS ADBBV AFFHD AFKRA AFPKN AFZYC ALMA_UNASSIGNED_HOLDINGS AMVHM ARAPS AZQEC BCNDV BENPR BGLVJ BPHCQ CCPQU CITATION DWQXO E3Z ESX GNUQQ GROUPED_DOAJ HCIFZ IAO J9A K6V K7- KQ8 L6V M7S MODMG M~E OK1 OVT P2P PHGZM PHGZT PIMPY PQGLB PQQKQ PROAC PTHSS TR2 TUS 3V. 7SC 7TB 7XB 8AL 8FD 8FK FR3 ICD JQ2 KR7 L7M L~C L~D M0N P62 PKEHL PQEST PQUKI PRINS Q9U |
| ID | FETCH-LOGICAL-c358t-5d26b9ce800a3231e209322fcf78e35ecfc62d8ebd7d2722fc9aa23e9ea0c9813 |
| IEDL.DBID | M7S |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000764475200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1999-4893 |
| IngestDate | Fri Oct 03 12:44:15 EDT 2025 Fri Jul 25 12:00:31 EDT 2025 Tue Nov 18 22:34:17 EST 2025 Sat Nov 29 07:20:01 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c358t-5d26b9ce800a3231e209322fcf78e35ecfc62d8ebd7d2722fc9aa23e9ea0c9813 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-0039-8878 |
| OpenAccessLink | https://www.proquest.com/docview/2632195813?pq-origsite=%requestingapplication% |
| PQID | 2632195813 |
| PQPubID | 2032439 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_89a8742f95fb4bc382184272c0dd27ea proquest_journals_2632195813 crossref_citationtrail_10_3390_a15020064 crossref_primary_10_3390_a15020064 |
| PublicationCentury | 2000 |
| PublicationDate | 2022-02-01 |
| PublicationDateYYYYMMDD | 2022-02-01 |
| PublicationDate_xml | – month: 02 year: 2022 text: 2022-02-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | Basel |
| PublicationPlace_xml | – name: Basel |
| PublicationTitle | Algorithms |
| PublicationYear | 2022 |
| Publisher | MDPI AG |
| Publisher_xml | – name: MDPI AG |
| References | Wang (ref_3) 2015; 46 Fan (ref_34) 2020; 13 Lin (ref_30) 2016; 4 Chisman (ref_8) 1975; 2 ref_36 ref_13 ref_35 ref_12 ref_10 ref_32 ref_31 ref_19 ref_18 Yang (ref_11) 2008; 18 ref_17 ref_16 ref_15 ref_37 ref_25 ref_24 ref_23 ref_22 ref_20 Dorigo (ref_27) 1996; 26 ref_2 Liu (ref_5) 2021; 118 Sharma (ref_14) 2021; 77 ref_29 ref_28 ref_9 Sharma (ref_21) 2020; 7 Lin (ref_1) 1973; 21 Shi (ref_4) 2022; 101 Kirkpatrick (ref_26) 1983; 220 ref_7 ref_6 Yuan (ref_33) 2017; 11 |
| References_xml | – ident: ref_22 doi: 10.1371/journal.pone.0123426 – ident: ref_28 – volume: 101 start-page: 553 year: 2022 ident: ref_4 article-title: Coupled orbit-attitude dynamics and trajectory tracking control for spacecraft electromagnetic docking publication-title: Appl. Math. Model. doi: 10.1016/j.apm.2021.08.030 – ident: ref_20 doi: 10.1145/2090236.2090249 – volume: 7 start-page: 1 year: 2020 ident: ref_21 article-title: A survey of computation techniques on time evolving graphs publication-title: Int. J. Big Data Intell. (IJBDI) – ident: ref_19 doi: 10.1145/2339530.2339539 – ident: ref_6 doi: 10.1109/TAES.2021.3130830 – volume: 4 start-page: 98 year: 2016 ident: ref_30 article-title: Solving Travelling Salesman Problem with an Improved Hybrid Genetic Algorithm publication-title: J. Comput. Commun. doi: 10.4236/jcc.2016.415009 – volume: 13 start-page: 1261 year: 2020 ident: ref_34 article-title: Incrementalization of Graph Partitioning Algorithms publication-title: Proc. VLDB Endow. doi: 10.14778/3389133.3389142 – volume: 11 start-page: 338 year: 2017 ident: ref_33 article-title: Effective and Efficient Dynamic Graph Coloring publication-title: Proc. VLDB Endow. doi: 10.14778/3157794.3157802 – volume: 2 start-page: 115 year: 1975 ident: ref_8 article-title: The clustered traveling salesman problem publication-title: Comput. Oper. Res. doi: 10.1016/0305-0548(75)90015-5 – ident: ref_35 – volume: 118 start-page: 107053 year: 2021 ident: ref_5 article-title: Are nonfragile controllers always better than fragile controllers in attitude control performance of post-capture flexible spacecraft? publication-title: Aerosp. Sci. Technol. doi: 10.1016/j.ast.2021.107053 – ident: ref_25 doi: 10.1109/ICNC.2013.6818008 – ident: ref_32 doi: 10.1145/3350755.3400255 – volume: 220 start-page: 671 year: 1983 ident: ref_26 article-title: Optimization by Simulated Annealing publication-title: Science doi: 10.1126/science.220.4598.671 – ident: ref_37 doi: 10.1145/2484838.2484843 – volume: 26 start-page: 29 year: 1996 ident: ref_27 article-title: Ant system: Optimization by a colony of cooperating agents publication-title: IEEE Trans. Syst. Man Cybern. Part B (Cybernetics) doi: 10.1109/3477.484436 – ident: ref_23 doi: 10.1109/BigDataCongress.2016.12 – ident: ref_24 doi: 10.1145/2556195.2556213 – ident: ref_12 – ident: ref_7 doi: 10.1007/978-1-4419-1153-7_1068 – ident: ref_36 doi: 10.1109/BigData.2015.7363735 – volume: 77 start-page: 10896 year: 2021 ident: ref_14 article-title: Distributed and incremental travelling salesman algorithm on time-evolving graphs publication-title: J. Supercomput. doi: 10.1007/s11227-021-03716-5 – ident: ref_15 – ident: ref_31 doi: 10.1049/cp:19951098 – ident: ref_9 doi: 10.1007/978-3-030-86271-8_10 – ident: ref_18 doi: 10.1145/1062745.1062885 – ident: ref_10 doi: 10.1007/978-3-642-16054-7_5 – ident: ref_13 – ident: ref_16 doi: 10.1145/1989323.1989420 – volume: 21 start-page: 498 year: 1973 ident: ref_1 article-title: An Effective Heuristic Algorithm for the Traveling-Salesman Problem publication-title: Oper. Res. doi: 10.1287/opre.21.2.498 – volume: 18 start-page: 1417 year: 2008 ident: ref_11 article-title: Ant colony optimization method for generalized TSP problem publication-title: Prog. Nat. Sci. doi: 10.1016/j.pnsc.2008.03.028 – ident: ref_17 doi: 10.1145/2915516.2915519 – ident: ref_2 doi: 10.1109/SWAT.1974.4 – volume: 46 start-page: 307 year: 2015 ident: ref_3 article-title: Robot Path Planning Based on the Travelling Salesman Problem publication-title: Chem. Eng. Trans. – ident: ref_29 doi: 10.1007/978-1-4613-0303-9_33 |
| SSID | ssj0065961 |
| Score | 2.2367349 |
| Snippet | In time-evolving graphs, the graph changes at each time interval, and the previously computed results become invalid. We addressed this issue for the traveling... |
| SourceID | doaj proquest crossref |
| SourceType | Open Website Aggregation Database Enrichment Source Index Database |
| StartPage | 64 |
| SubjectTerms | Algorithms Apexes Computation Evolution graph partitioning Graphs incremental algorithm Partitioning Simulation time-evolving graphs Traveling salesman problem |
| SummonAdditionalLinks | – databaseName: DOAJ Directory of Open Access Journals dbid: DOA link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELZQxcDCG1EoyEIMLFETO4ntsaAWBqgqUaBb5DgOILUpagq_nzsnqUAgsbBkSM55fBffS_Z3hJwLY8FrBZnHI2O9EA8yELgSIM1iGJNbR1_8eCuGQzmZqNGXVl-4JqyiB66A60qlJaRvuYryNEwNl5iTMMGMn2VMWBca-UI1yVRlg-NIxUHFI8Qhqe9qCHswdw6_eR9H0v_DBjvHMtgmm3VESHvVm-yQNVvskq2m2wKtJ98eeeoZAz4CqR0ozOqqrgcDx_cj2ps-zyHLf5mVdF5Q3NZB-2B3sFhAr5GSuqRYcKUj_N66BEvvXPPocp88DPrjqxuvbovgGR7JpRdlLE6VsRDqaQ7hmWU-BGEsN7mQlkeAr4lZJm2aCUAILyitGbfKat8oGfAD0irmhT0kVCppTRBaCKN0qOJUw11zsN4y5UKYIG-TiwauxNSc4di6YppA7oDIJitk2-RsJfpWEWX8JnSJmK8EkNvanQCNJ7XGk7803iadRmNJPeHKBGnnkTcn4Ef_8YxjssFwn4Nbnt0hreXi3Z6QdfOxfC0Xp-5f-wTHwdnN priority: 102 providerName: Directory of Open Access Journals |
| Title | Accelerate Incremental TSP Algorithms on Time Evolving Graphs with Partitioning Methods |
| URI | https://www.proquest.com/docview/2632195813 https://doaj.org/article/89a8742f95fb4bc382184272c0dd27ea |
| Volume | 15 |
| WOSCitedRecordID | wos000764475200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1999-4893 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0065961 issn: 1999-4893 databaseCode: DOA dateStart: 20080101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1999-4893 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0065961 issn: 1999-4893 databaseCode: M~E dateStart: 20080101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1999-4893 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0065961 issn: 1999-4893 databaseCode: K7- dateStart: 20080301 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1999-4893 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0065961 issn: 1999-4893 databaseCode: M7S dateStart: 20080301 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1999-4893 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0065961 issn: 1999-4893 databaseCode: BENPR dateStart: 20080301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 1999-4893 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0065961 issn: 1999-4893 databaseCode: PIMPY dateStart: 20080301 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3Nb9MwFH8aLQcujMEQHaOyEAcu0Zo4ie3T1KJ2TFuriA7WnSLHcQbS1nZN4cjfznuu0wkN7cLFh_hDeXn2-8rz7wF8EMai1grLgCfGBjE1MhSUCVCUKc6prIMv_nYuJhM5m6nMB9xqn1bZyEQnqMuFoRj5EeGKEzBKyI-XdwFVjaK_q76ExhNoE0pC6FL3po0kThOVhhs0IY6u_ZFG44c86PgvHeSg-h9IYqdeRrv_-2Iv4Lk3LFl_sxP2YMfOX8JuU7SB-TP8Ci77xqCqIYQIhsJhEx7EiRfTjPVvrnHl9ffbmi3mjG6HsCGKL4o5sBNCtq4ZxW1ZRvvNR3LZ2NWgrvfh62h48elz4KsrBIYnch0kZZQWyli0GDVHK89GPbTlospUQlqeIJtMGpXSFqUoI0EdSuuIW2V1zygk9zW05ou5fQNMKmlNGFu0xnSs0kLjqhUqAVlwIUxYdeBj871z46HHqQLGTY4uCLEm37KmA--3Q5cbvI1_DRoQ07YDCCLbPVisrnN_4nKptES_v1JJVcSF4ZKcWSTE9Eqkx-oOHDb8zP25rfN7Zh483v0WnkV0EcLlbx9Ca736ad_BU_Nr_aNedaE9GE6yL13n4WN7JoKu25rU_h5if3Y6zq7-AJgC7lQ |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwEB5RqFQuvFrEAqUWolIvERs7ie1Dhba8tctqpW5bbsFxHECCXdgsVPwpfiMzeSyqWvXGgUsO8SNxPP7mEfsbgC1pHWotP_VEaJ0X0EX5knYCJGmEbTJX0Bf_7MhuV52e6t4UPNZnYWhbZY2JBVCnQ0sx8m3iFSdiFF_s3Nx6lDWK_q7WKTRKsWi7h9_osuVfj_dwfj9zfrDf3z3yqqwCnhWhGnthyqNEW4eWkhFo3TiOTj3nmc2kciLE17MRT5VLUplySQXaGC6cdqZpNT4f-30DM4FQktZVW3o18kehjvySvUgI3dw2aGyRxx78ofOK1AB_IX-hzg7mX9uHWIC5ynBmrVLSF2HKDZZgvk5KwSqMeg-_WtaiKiUGDIbgV4Y_sWH_e4-1rs5xJOOL65wNB4xOv7B9hGeKqbBDYu7OGcWlWY_WUxWpZidFju38A_x4keEtw_RgOHArwJRWzvqBQ2vTBDpKDPaaoZJTiZDS-lkDvtTzG9uKWp0yfFzF6GKRKMQTUWjA5qTqTckn8q9K30hIJhWIAry4MRydxxWixEobJQOe6TBLgsQKRc46DsQ2UxyPMw1Yr-UnrnApj5-FZ_X_xZ_g3VH_pBN3jrvtNZjldOij2Ku-DtPj0Z37CG_t_fgyH20US4DB2UuL2hOTm0Ys |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwEB7Rpaq4QKFUbKGtVVGpl2g3dh72AVVLYcsKWEUqz1PqOA6tRHdhs1Dx1_h1zCTOVlWr3jj0kkP8kB1_nlfsbwA2Y2NRa_m5J0JjvYAe0o_pJECWR9imsBV98clBPBzKszOVzMF9cxeGjlU2MrES1PnYUIy8Q7ziRIzii07hjkUkO_2PV9ceZZCiP61NOo0aIvv27ie6b-XWYAfX-j3n_d2jT3ueyzDgGRHKqRfmPMqUsWg1aYGWjuXo4HNemCKWVoQ4VBPxXNosj3MeU4HSmgurrO4ahWPBfp_APJrkAW_BfDI4TM4bPRCFKvJrLiMhVLej0fQi_z34TQNWiQL-0AOVcusv_c-f5TksOpOa9eo9sAxzdrQCS026Cuak1ws47RmDSpa4MRiKxTowig2PviSsd3mBM5l--1Gy8YjRvRi2i4Kboi3sM3F6l4wi1iyhneZi2Oywyr5drsLxo0zvJbRG45FdAyaVtMYPLNqhOlBRprHXAtWfzEQcG79ow4dmrVPjSNcp98dlis4XwSKdwaIN72ZVr2qmkb9V2ibAzCoQOXj1Yjy5SJ2sSaXSEgFZqLDIgswISW48TsR0c5yP1W3YaLCUOolVpr-A9OrfxW_hGSIsPRgM99dhgdNtkOoQ-wa0ppMb-xqemtvp93Lyxu0HBl8fG2sPfqJQrQ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Accelerate+Incremental+TSP+Algorithms+on+Time+Evolving+Graphs+with+Partitioning+Methods&rft.jtitle=Algorithms&rft.au=Sharma%2C+Shalini&rft.au=Chou%2C+Jerry&rft.date=2022-02-01&rft.pub=MDPI+AG&rft.eissn=1999-4893&rft.volume=15&rft.issue=2&rft.spage=64&rft_id=info:doi/10.3390%2Fa15020064&rft.externalDBID=HAS_PDF_LINK |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1999-4893&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1999-4893&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1999-4893&client=summon |