[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-en-105":3,"doc-seo-295851-105":59,"doc-detail-295851-en":130},{"code":4,"msg":5,"data":6},0,"success",[7,13,18,23,28,33,38,43,48,51,55],{"id":8,"doc_module":4,"doc_module_name":9,"category_name":10,"show_sort_weight":11,"slug":12},1,"Document","Story & Novel",90,"story-novel",{"id":14,"doc_module":4,"doc_module_name":9,"category_name":15,"show_sort_weight":16,"slug":17},2,"Literature",80,"literature",{"id":19,"doc_module":4,"doc_module_name":9,"category_name":20,"show_sort_weight":21,"slug":22},4,"Exam",70,"exam",{"id":24,"doc_module":4,"doc_module_name":9,"category_name":25,"show_sort_weight":26,"slug":27},5,"Comic",60,"comic",{"id":29,"doc_module":4,"doc_module_name":9,"category_name":30,"show_sort_weight":31,"slug":32},6,"Technology",50,"technology",{"id":34,"doc_module":4,"doc_module_name":9,"category_name":35,"show_sort_weight":36,"slug":37},7,"Healthcare",40,"healthcare",{"id":39,"doc_module":4,"doc_module_name":9,"category_name":40,"show_sort_weight":41,"slug":42},8,"Research & Report",30,"research-report",{"id":44,"doc_module":4,"doc_module_name":9,"category_name":45,"show_sort_weight":46,"slug":47},9,"Religion & Spirituality",20,"religion-spirituality",{"id":46,"doc_module":4,"doc_module_name":9,"category_name":49,"show_sort_weight":46,"slug":50},"World Cup","world-cup",{"id":52,"doc_module":4,"doc_module_name":9,"category_name":53,"show_sort_weight":52,"slug":54},10,"Lifestyle","lifestyle",{"id":56,"doc_module":4,"doc_module_name":9,"category_name":57,"show_sort_weight":24,"slug":58},19,"General","general",{"code":4,"msg":60,"data":61},"ok",{"site_id":62,"language":63,"slug":64,"title":65,"keywords":66,"description":67,"schema_data":68,"social_meta":123,"head_meta":125,"extra_data":127,"updated_unix":129},105,"en","karlsruhe-reports-in-informatics-20135-technical-report-hidar","Karlsruhe Reports in Informatics 2013,5 - Technical Report - HiDAR","","Alternatives to a shortest path are a common requirement in modern navigation. While speed-up methods rely on unique distances between locations, computing alternatives that may be slightly suboptimal is substantially harder. Testing an alternative’s quality typically requires heavy computational overhead, so current systems settle for any viable route rather than identifying the best alternatives. This paper introduces an effective approach that enables high-quality alternative route computation while keeping competitive query times.",{"@graph":69,"@context":122},[70,84,105],{"@type":71,"itemListElement":72},"BreadcrumbList",[73,77,79,82],{"item":74,"name":75,"@type":76,"position":8},"https://docshare.wps.com","Home","ListItem",{"item":78,"name":9,"@type":76,"position":14},"https://docshare.wps.com/document/",{"item":80,"name":30,"@type":76,"position":81},"https://docshare.wps.com/document/technology/",3,{"item":83,"name":65,"@type":76,"position":19},"https://docshare.wps.com/document/karlsruhe-reports-in-informatics-20135-technical-report-hidar/295851/",{"url":83,"name":65,"@type":85,"image":86,"author":91,"headline":65,"publisher":94,"fileFormat":97,"inLanguage":63,"description":67,"dateModified":98,"datePublished":99,"encodingFormat":97,"isAccessibleForFree":100,"interactionStatistic":101},"DigitalDocument",{"url":87,"@type":88,"width":89,"height":90},"https://docshare.wps.com/thumbnails/karlsruhe-reports-in-informatics-20135-technical-report-hidar/295851.png","ImageObject",300,407,{"name":92,"@type":93},"Aria","Person",{"url":74,"name":95,"@type":96},"DocShare","Organization","application/pdf","2026-10-14","2026-09-18",true,{"@type":102,"interactionType":103,"userInteractionCount":34},"InteractionCounter",{"@type":104},"ViewAction",{"@type":106,"mainEntity":107},"FAQPage",[108,114,118],{"name":109,"@type":110,"acceptedAnswer":111},"Why are alternative routes difficult to compute compared with shortest paths?","Question",{"text":112,"@type":113},"Computing alternative routes may involve slightly suboptimal paths, and evaluating their quality requires considerable computational overhead.","Answer",{"name":115,"@type":110,"acceptedAnswer":116},"What does the paper propose to address the overhead problem?",{"text":117,"@type":113},"It presents a new method to handle the quality-testing overhead efficiently, enabling high-quality alternative routes with competitive query times.",{"name":119,"@type":110,"acceptedAnswer":120},"How does the paper define and use terminology for alternative routes?",{"text":121,"@type":113},"It focuses on alternative routes according to the definition of Abraham et al. and introduces terminology in Section 2, then uses it throughout the algorithmic approach.","https://schema.org",{"og:url":83,"og:type":124,"og:title":65,"og:site_name":95,"og:description":67},"article",{"robots":126,"canonical":83},"index,follow",{"doc_id":128,"site_id":62},295851,1791412129,{"code":4,"msg":5,"data":131},{"doc_id":128,"user_id":132,"nickname":92,"user_avatar":133,"doc_module":4,"category_id":29,"category_name":30,"doc_title":65,"doc_description":67,"doc_content":134,"file_id":135,"file_url":136,"file_type":137,"file_size":138,"view_count":34,"is_deleted":4,"is_public":8,"is_downloadable":8,"audit_status":8,"page_count":139,"language":140,"language_code":63,"site_id":62,"html_lang":63,"table_of_contents":141,"faqs":142,"seo_title":143,"seo_description":67,"update_tm":144,"read_time":145},2336464648322,"https://ap-avatar.wpscdn.com/avatar/2200025388227c56fec?_k=1778556882303663488","Karlsruhe Reports in Informatics 2013,5  \nEdited by Karlsruhe Institute of Technology, Faculty of Informatics  \nISSN 2190-4782  \nAn Alternative Approach to Alternative Routes:  \nHiDAR  \nTechnical Report  \nMoritz Kobitzsch  \n2013  \nKIT – University of the State of Baden-Wuerttemberg and National Research Center of the Helmholtz Association  \nPlease note:  \nThis Report has been published on the Internet under the following Creative Commons License: [http://creativecommons.org/licenses/by-nc-nd/3.0/de.](http://creativecommons.org/licenses/by-nc-nd/3.0/de.)  \nAn Alternative Approach to Alternative Routes: HiDAR  \nTechnical Report  \nMoritz Kobitzsch  \nJune 12, 2013  \nAbstract  \nAlternatives to a shortest path are a common feature for modern navigation providers. In contrast to modern speed-up techniques, which are based on the unique distance between two locations within the map, computing alternative routes that might include slightly suboptimal routes seems a way more di􀀎cult problem. Especially testing a possible alternative route for its quality can so far only be done utilizing considerable computational overhead. This forces current solutions to settle for any viable alternative instead of 􀀌nding the best alternative routes possible. In this paper we show a new way on how to deal with this overhead in an e􀀋ective manner, allowing for the computation of high quality alternative routes while maintaining competitive query times.  \n1 Introduction  \nThe process of 􀀌nding a single shortest path in a graph with respect to some weight function has come a long way from Dijkstra's algorithm [Dij59], which allows for solutions in almost linear time. Speed-up techniques [GKW06, GSSD08 , DSSW09 , DGPW11] o􀀋er real time shortest path computation through extensive use of preprocessing. These techniques are used in many web-based navigation services that provide driving directions to the general public.  \nEven though the computed paths do not rely on heuristics, the optimality of a shortest path remains a subjective measure. Navigation services o􀀋er multiple choices, hoping one of them might re􀀍ect the preferences of the user. These choices are referred to as alternative routes. The 􀀌rst formal mention of alternative routes, aside from the k-shortest path problem or blocked vertex/arc routes, can be found in [Cam] . Still, until Abraham et al. [ADGW12] introduced the idea of via-node alternatives, which describe an alternative route using source, target, and an additional vertex, only proprietary algorithms were used by navigation providers. This approach was later on improved by Luxen and Schieferdecker through use of extensive preprocessing [LS12], while Bader et al. [BDGS11] proposed an entirely di􀀋erent approach using penalties.  \nIn this paper we focus on alternative routes using the de􀀌nition of Abraham et al. [ADGW12] . So far, via-node alternatives [ADGW12, LS12] focus on reporting any alternative route, satisfying some minimal quality 1 requirements, as current techniques require three full shortest path queries, which we will describe later on, to check a potential route for its quality.  \nAfter the introduction of our terminology in Section 2 and a more extensive discussion of the work related to this paper in Section 3, we introduce a new algorithm to solve the problem of  \n1 We will focus on the exact de􀀌nition of quality later on.  \nalternative routes in Section 4. Our algorithm allows for the selection of the best possible among the found candidates by reducing the problem to a small graph representing all potentially viable alternative routes. We evaluate our algorithm in Section 9 where we show not only the possibility of calculating higher quality routes but also show the competitiveness regarding query times.  \n2 De􀀌nitions and Terminology  \nEvery road network can be viewed as a directed and weighted graph:  \nDe􀀌nition 1 (Graph,Restricted Graph) . A weighted graph G = (V; A; c) is described as a set of vertices V; j Vj = n","cbCaiokNPIVvTg66","https://ap.wps.com/l/cbCaiokNPIVvTg66","pdf",451612,18,"English","# Abstract\n# 1 Introduction\n# 2 Definitions and Terminology\n# 3 Related Work\n## 3.1 Speed-up Techniques","[{\"question\":\"Why are alternative routes difficult to compute compared with shortest paths?\",\"answer\":\"Computing alternative routes may involve slightly suboptimal paths, and evaluating their quality requires considerable computational overhead.\"},{\"question\":\"What does the paper propose to address the overhead problem?\",\"answer\":\"It presents a new method to handle the quality-testing overhead efficiently, enabling high-quality alternative routes with competitive query times.\"},{\"question\":\"How does the paper define and use terminology for alternative routes?\",\"answer\":\"It focuses on alternative routes according to the definition of Abraham et al. and introduces terminology in Section 2, then uses it throughout the algorithmic approach.\"}]","Karlsruhe Reports in Informatics 2013,5 - Technical Report - HiDAR | PDF",1789724590,45]