Edge Distributed Admission Control for Performance Improvement in Traffic Engineered Networks
QoS-IP 2003 Proceedings of the Second International Workshop on Quality of Service in Multiservice IP Networks
Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Translation with Finite-State Devices
AMTA '98 Proceedings of the Third Conference of the Association for Machine Translation in the Americas on Machine Translation and the Information Soup
Adaptive QoS provisioning by pricing incentive QoS routing for next generation networks
Computer Communications
A comparative evaluation of different link types on enhancing document clustering
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Path Generation Issues for Survivable Network Design
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
A dynamic programming approach for finding shortest chains in a fuzzy network
Applied Soft Computing
Finding a least hop(s) path subject to multiple additive constraints
Computer Communications
Explicit routing in multicast overlay networks
Computer Communications
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Energy-efficient routing in Wireless Sensor Networks for delay sensitive applications
International Journal of Ad Hoc and Ubiquitous Computing
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Computing a fuzzy shortest path in a network with mixed fuzzy arc lengths using α-cuts
Computers & Mathematics with Applications
Navigating in complex mashed-up applications
Proceedings of the VLDB Endowment
A contamination aware droplet routing algorithm for the synthesis of digital microfluidic biochips
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An efficient algorithm to enable path diversity in link state routing networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Alternative route graphs in road networks
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Complex pattern ranking (CPR): evaluating top-k pattern queries over event streams
Proceedings of the 5th ACM international conference on Distributed event-based system
A graph approach to spelling correction in domain-centric search
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Improving back-transliteration by combining information sources
IJCNLP'04 Proceedings of the First international joint conference on Natural Language Processing
Alternative routes in road networks
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Direct combination of spelling and pronunciation information for robust back-transliteration
CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Fast restoring gigabit wireless networks using a directional mesh architecture
Computer Communications
Improved algorithms for replacement paths problems in restricted graphs
Operations Research Letters
Bucket and mini-bucket schemes for m best solutions over graphical models
GKR'11 Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning
Top-k queries over web applications
The VLDB Journal — The International Journal on Very Large Data Bases
Topology-aware virtual network embedding based on closeness centrality
Frontiers of Computer Science: Selected Publications from Chinese Universities
Simple analysis of partial worst-case execution paths on general control flow graphs
Proceedings of the Eleventh ACM International Conference on Embedded Software
Resource allocation with multi-factor node ranking in data center networks
Future Generation Computer Systems
| Hi-index | 0.00 |
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m+n log n+k). We can also find the k shortest paths from a given source s to each vertex in the graph, in total time O(m+n log n+kn). We describe applications to dynamic programming problems including the knapsack problem, sequence alignment, and maximum inscribed polygons.