Answering Min-Max Resource-Constrained Shortest Path Queries Over Large Graphs

The constrained shortest path problem is a fundamental and challenging task in applications built on graphs. In this paper, we formalize and study the <inline-formula><tex-math notation="LaTeX">Min</tex-math> <mml:math><mml:mrow><mml:mi>M</mml:mi>&...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on knowledge and data engineering Ročník 37; číslo 1; s. 60 - 74
Hlavní autori:	Qian, Haoran, Zheng, Weiguo, Zhang, Zhijie, Fu, Bo
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	IEEE 01.01.2025
Predmet:	<named-content xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" content-type="math" xlink:type="simple"> <inline-formula> <tex-math notation="LaTeX"> Min</tex-math> <mml:math> <mml:mrow> <mml:mi>M</mml:mi> <mml:mi>i</mml:mi> <mml:mi>n</mml:mi> </mml:mrow> </mml:math> <inline-graphic xlink:href="qian-ieq6-3488095.gif" xlink:type="simple"/> </inline-formula> </named-content>-<inline-formula xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"> <tex-math notation="LaTeX"> Max</tex-math> <mml:math> <mml:mrow> <mml:mi>M</mml:mi> <mml:mi>a</mml:mi> <mml:mi>x</mml:mi> </mml:mrow> </mml:math> <inline-graphic xlink:href="qian-ieq7-3488095.gif" xlink:type="simple"/> </inline-formula> constraint Accuracy ancestor checking Correlation Costs Delays graph algorithms incremental search Intellectual property Search problems Shortest path problem shortest path query Time factors Valves Vehicle routing
ISSN:	1041-4347, 1558-2191
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!