资 源 简 介
前k条最短路径（KSP）算法在国内鲜有研究，本压缩包中文献整合了自1971年此问题被提出后几十年来的论文共25篇。
其中以Martin先生的删除（Delelte）算法与Yen先生的背离（Devation）算法为主。
其中所有文献均来自网络。含有两篇中文文章以及23篇英文文章。
算法的复杂度基本控制于O(logn)内-Pre-k shortest paths (KSP) algorithm in the domestic few studies in the literature in this compressed package integration since 1971, this issue has been moved for several decades a total of 25 papers. Among them, Mr. Martin removed (Delelte) algorithm and Mr. Yen departure (Devation) algorithm is based. In which all documents are from the network. Contains two Chinese articles and 23 articles in English. The complexity of basic control algorithms in O (logn) in
文 件 列 表
ebooks
其他应用论文（在其中应用到了Yen的算法）
中文文档
Ernesto de Queiros Vieira Martins & Marta Margarida Braz Pascoal
David Eppstein
A BICRITERION APPROACH FOR ROUTING PROBLEMS IN MULTIMEDIA NETWORKS.pdf
A SHORTEST PATH ALGORITHM FOR REAL ROAD NETWORK BASED ON PATH OVERLAP.pdf
A SHORTEST PATHS RANKING ALGORITHM.pdf
A TIME-DEPENDENT k-SHORTEST PATH ALGORITHM FOR ATIS APPLICATIONS.pdf
Finding the k Shortest Simple Paths——A New Algorithm and its Implementation.pdf
Implementation of K-shortest Path Dijkstra Algorithm used in All-optical Data Communication Networks.pdf
Implementations and empirical comparison of K shortest loopless path algorithms.pdf
K shortest path algorithms (santos).pdf
k-path.bib
BiBlioGRAphY.clean
Temperature Driven Mass Transport in Concentrated Saturated Solutions.pdf
The Algebraic Monge Property and Path Problems.pdf
k-path.bib
