Zobrazeno 1 - 10
of 50
pro vyhledávání: '"Theory of computation → Shortest paths"'
We present Arc-Flag TB, a journey planning algorithm for public transit networks which combines Trip-Based Public Transit Routing (TB) with the Arc-Flags speedup technique. Compared to previous attempts to apply Arc-Flags to public transit networks,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::02d270ab031e5032892eb5409ae94341
http://arxiv.org/abs/2302.07168
http://arxiv.org/abs/2302.07168
Autor:
Bilò, Davide, Choudhary, Keerti, Cohen, Sarel, Friedrich, Tobias, Krogmann, Simon, Schirneck, Martin
We study the problem of estimating the $ST$-diameter of a graph that is subject to a bounded number of edge failures. An $f$-edge fault-tolerant $ST$-diameter oracle ($f$-FDO-$ST$) is a data structure that preprocesses a given graph $G$, two sets of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::087621af55cef08ca54db55769a49d62
In the shortest path interdiction problem, an interdictor aims to remove arcs of total cost at most a given budget from a directed graph with given arc costs and traversal times such that the length of a shortest s-t-path is maximized. For static gra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d4a18ded8d5be9b705c9a0029d8e25a5
Autor:
Karczmarz, Adam, Sankowski, Piotr
We study the exact fully dynamic shortest paths problem. For real-weighted directed graphs, we show a deterministic fully dynamic data structure with Õ(mn^{4/5}) worst-case update time processing arbitrary s,t-distance queries in Õ(n^{4/5}) time.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::25362ca13ce4b3d9bec031e38f666145
Identifying influential nodes in a network is arguably one of the most important tasks in graph mining and network analysis. A large variety of centrality measures, all aiming at correctly quantifying a node’s importance in the network, have been f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6590a0a5561093c200d1667ffe15362d
Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path problem
Autor:
Dey, Dipan, Gupta, Manoj
In a graph $G$ with a source $s$, we design a distance oracle that can answer the following query: Query$(s,t,e)$ -- find the length of shortest path from a fixed source $s$ to any destination vertex $t$ while avoiding any edge $e$. We design a deter
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::068402db711e90465403935ce953d48f
http://arxiv.org/abs/2206.15016
http://arxiv.org/abs/2206.15016
Autor:
Neiman, Ofer, Shabat, Idan
Given an undirected graph G = (V,E), an (α,β)-hopset is a graph H = (V,E'), so that adding its edges to G guarantees every pair has an α-approximate shortest path that has at most β edges (hops), that is, d_G(u,v) ≤ d_{G∪H}^(β)(u,v) ≤ α
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::168dcbb4cab5ee1bef6f416828b85274
Autor:
Rajan, Payas, Ravishankar, Chinya V.
Electric Vehicle routing is often modeled as a generalization of the energy-constrained shortest path problem, taking travel times and energy consumptions on road network edges to be deterministic. In practice, however, energy consumption and travel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::201dd393833fb62e9d96856a5eb54e21
Autor:
Zeitz, Tim
We study the shortest smooth path problem (SSPP), which is motivated by traffic-aware routing in road networks. The goal is to compute the fastest route according to the current traffic situation while avoiding undesired detours, such as briefly usin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07ba1c410ff4f40465b34c749e2f71bc
https://publikationen.bibliothek.kit.edu/1000149126
https://publikationen.bibliothek.kit.edu/1000149126
Front Matter, Table of Contents, Preface, Conference Organization
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 0:i-0:xxii
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 0:i-0:xxii
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c19753a37740f965274159d7f92b57a5