{"id":"https://openalex.org/W2947589198","doi":"https://doi.org/10.5220/0007658200260032","title":"The e-approximation of the Label Correcting Modification of the Dijkstra's Algorithm","display_name":"The e-approximation of the Label Correcting Modification of the Dijkstra's Algorithm","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2947589198","doi":"https://doi.org/10.5220/0007658200260032","mag":"2947589198"},"language":"en","primary_location":{"id":"doi:10.5220/0007658200260032","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0007658200260032","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th International Conference on Geographical Information Systems Theory, Applications and Management","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.5220/0007658200260032","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055812091","display_name":"Franti\u0161ek Kolovsk\u00fd","orcid":"https://orcid.org/0000-0002-2070-5871"},"institutions":[{"id":"https://openalex.org/I92715842","display_name":"University of West Bohemia in Pilsen","ror":"https://ror.org/040t43x18","country_code":"CZ","type":"education","lineage":["https://openalex.org/I92715842"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Franti\u0161ek Kolovsk\u00fd","raw_affiliation_strings":["Depatment of Geomatics, University of West Bohemia, Univerzitn\u00ed 2732/8, Plze\u0148 and Czech Republic, --- Select a Country ---"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Depatment of Geomatics, University of West Bohemia, Univerzitn\u00ed 2732/8, Plze\u0148 and Czech Republic, --- Select a Country ---","institution_ids":["https://openalex.org/I92715842"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101771963","display_name":"Jan Je\u017eek","orcid":"https://orcid.org/0000-0002-1868-117X"},"institutions":[{"id":"https://openalex.org/I92715842","display_name":"University of West Bohemia in Pilsen","ror":"https://ror.org/040t43x18","country_code":"CZ","type":"education","lineage":["https://openalex.org/I92715842"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jan Je\u017eek","raw_affiliation_strings":["Depatment of Geomatics, University of West Bohemia, Univerzitn\u00ed 2732/8, Plze\u0148 and Czech Republic, --- Select a Country ---"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Depatment of Geomatics, University of West Bohemia, Univerzitn\u00ed 2732/8, Plze\u0148 and Czech Republic, --- Select a Country ---","institution_ids":["https://openalex.org/I92715842"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042317568","display_name":"Ivana Kolingerov\u00e1","orcid":"https://orcid.org/0000-0003-4556-2771"},"institutions":[{"id":"https://openalex.org/I92715842","display_name":"University of West Bohemia in Pilsen","ror":"https://ror.org/040t43x18","country_code":"CZ","type":"education","lineage":["https://openalex.org/I92715842"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Ivana Kolingerov\u00e1","raw_affiliation_strings":["Department of Computer Science, University of West Bohemia, Univerzitn\u00ed 2732/8, Plze\u0148 and Czech Republic, --- Select a Country ---"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of West Bohemia, Univerzitn\u00ed 2732/8, Plze\u0148 and Czech Republic, --- Select a Country ---","institution_ids":["https://openalex.org/I92715842"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I92715842"],"apc_list":null,"apc_paid":null,"fwci":0.167,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.42942358,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"26","last_page":"32"},"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9837999939918518,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.9154196977615356},{"id":"https://openalex.org/keywords/precomputation","display_name":"Precomputation","score":0.8269579410552979},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.7610924243927002},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.636447548866272},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6247959733009338},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5550970435142517},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5265660285949707},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5251253247261047},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5122575163841248},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.48404091596603394},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4632301330566406},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.46112364530563354},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.45396316051483154},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.45094797015190125},{"id":"https://openalex.org/keywords/a*-search-algorithm","display_name":"A* search algorithm","score":0.4136057496070862},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2867478132247925},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1879843771457672},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08338350057601929},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.05929878354072571}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.9154196977615356},{"id":"https://openalex.org/C159379195","wikidata":"https://www.wikidata.org/wiki/Q7239568","display_name":"Precomputation","level":3,"score":0.8269579410552979},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.7610924243927002},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.636447548866272},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6247959733009338},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5550970435142517},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5265660285949707},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5251253247261047},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5122575163841248},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.48404091596603394},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4632301330566406},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.46112364530563354},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45396316051483154},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.45094797015190125},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.4136057496070862},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2867478132247925},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1879843771457672},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08338350057601929},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.05929878354072571},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.5220/0007658200260032","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0007658200260032","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th International Conference on Geographical Information Systems Theory, Applications and Management","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace5.zcu.cz:11025/51709","is_oa":true,"landing_page_url":"http://hdl.handle.net/11025/51709","pdf_url":"https://dspace.zcu.cz/bitstreams/2adc7eda-1a15-49ab-acdc-33b42ca9ea64/download","source":{"id":"https://openalex.org/S4306400586","display_name":"Digital Library (University of West Bohemia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I92715842","host_organization_name":"University of West Bohemia in Pilsen","host_organization_lineage":["https://openalex.org/I92715842"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"konferen\u010dn\u00ed p\u0159\u00edsp\u011bvek"}],"best_oa_location":{"id":"doi:10.5220/0007658200260032","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0007658200260032","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th International Conference on Geographical Information Systems Theory, Applications and Management","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W43621356","https://openalex.org/W101345945","https://openalex.org/W1671142266","https://openalex.org/W2050634818","https://openalex.org/W2089338760","https://openalex.org/W2116643655","https://openalex.org/W2163978269","https://openalex.org/W2757192859","https://openalex.org/W4250131469"],"related_works":["https://openalex.org/W2136320479","https://openalex.org/W2147862592","https://openalex.org/W2372677512","https://openalex.org/W2348287729","https://openalex.org/W2381351584","https://openalex.org/W3205035283","https://openalex.org/W2371042914","https://openalex.org/W1508906807","https://openalex.org/W2381419702","https://openalex.org/W2300444527"],"abstract_inverted_index":{"This":[0,15],"paper":[1,34],"is":[2,17,26,44,61,77,84],"focused":[3],"on":[4,46],"searching":[5],"the":[6,37,59,64,73,80,86,100,119],"shortest":[7,21],"paths":[8],"for":[9,28,110],"all":[10],"departure":[11],"times":[12],"(profile":[13],"search).":[14],"problem":[16,23],"called":[18],"a":[19,47],"time-dependent":[20,112],"path":[22],"(TDSP)":[24],"and":[25,95],"important":[27],"optimization":[29],"in":[30],"transportation.":[31],"Particularly":[32],"this":[33],"deals":[35],"with":[36],"\u03b5-approximation":[38],"of":[39,51,58,93,103],"TDSP.":[40],"The":[41,55],"proposed":[42,87],"algorithm":[43,53,60],"based":[45],"label":[48],"correcting":[49],"modification":[50],"Dijkstra's":[52],"(LCA).":[54],"main":[56],"idea":[57],"to":[62,99],"simplify":[63],"arrival":[65],"function":[66],"after":[67],"every":[68],"relaxation":[69],"step":[70,109],"so":[71],"that":[72],"maximum":[74,81],"relative":[75,82],"error":[76,83],"maintained.":[78],"When":[79],"0.001,":[85],"solution":[88],"saves":[89],"more":[90,106],"than":[91],"95%":[92],"breakpoints":[94],"80%":[96],"time":[97],"compared":[98],"exact":[101],"version":[102],"LCA.":[104],"A":[105],"efficient":[107],"precomputation":[108],"another":[111],"routing":[113],"algorithms":[114],"can":[115],"be":[116],"built":[117],"using":[118],"developed":[120],"algorithm.":[121]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}