Unified approach fuzzy graph problems
Fuzzy Sets and Systems - Theme: Decision and optimization
Modeling Costs of Turns in Route Planning
Geoinformatica
Multipath Routing to Provide Quality of Service in Mobile Ad Hoc Networks
IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
Fault Tolerance and Load Balancing in QoS Provisioning with Multiple MPLS Paths
IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
On the Difficulty of Some Shortest Path Problems
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
CNOP - A Package for Constrained Network Optimization
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Generic Model Abstraction from Examples
Revised Papers from the International Workshop on Sensor Based Intelligent Robots
Resource Constrained Shortest Paths
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Path Computation for Traffic Engineering in MPLS Networks
ICN '01 Proceedings of the First International Conference on Networking-Part 2
LVMSR: an efficient algorithm to multicast layered video
Computer Networks: The International Journal of Computer and Telecommunications Networking
Algorithms for shortest paths and d-cycle problems
Journal of Discrete Algorithms
Finding the first K shortest paths in a time-window network
Computers and Operations Research
An exact algorithm for the robust shortest path problem with interval data
Computers and Operations Research
Finding K shortest looping paths in a traffic-light network
Computers and Operations Research
Finding next-to-shortest paths in a graph
Information Processing Letters
All maximal independent sets and dynamic dominance for sparse graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Generic Model Abstraction from Examples
IEEE Transactions on Pattern Analysis and Machine Intelligence
Dependency Parsing with an Extended Finite-State Approach
Computational Linguistics
Splitting (complicated) surfaces is hard
Proceedings of the twenty-second annual symposium on Computational geometry
Generating k-best solutions to auction winner determination problems
ACM SIGecom Exchanges
On the difficulty of some shortest path problems
ACM Transactions on Algorithms (TALG)
Dynamic multicast routing algorithm for delay and delay variation-bounded Steiner tree problem
Knowledge-Based Systems
Finding the K shortest hyperpaths
Computers and Operations Research
The most probable annotation problem in HMMs and its application to bioinformatics
Journal of Computer and System Sciences
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the K-simple shortest paths problem in weighted directed graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
An electromagnetic meta-heuristic for the nurse scheduling problem
Journal of Heuristics
Finding the k shortest simple paths: A new algorithm and its implementation
ACM Transactions on Algorithms (TALG)
Ad hoc routing for multilevel power save protocols
Ad Hoc Networks
Journal of Network and Computer Applications
A near-linear time algorithm for computing replacement paths in planar directed graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Splitting (complicated) surfaces is hard
Computational Geometry: Theory and Applications
Reinforcing probabilistic selective Quality of Service routes in dynamic irregular networks
Computer Communications
Finding reliable subgraphs from large probabilistic graphs
Data Mining and Knowledge Discovery
Write it recursively: a generic framework for optimal path queries
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
ECML '07 Proceedings of the 18th European conference on Machine Learning
Complexity results in revising UNITY programs
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Improved algorithms for the k simple shortest paths and the replacement paths problems
Information Processing Letters
Applications of Page Ranking in P Systems
Membrane Computing
On path selection and rate allocation for video in wireless mesh networks
IEEE/ACM Transactions on Networking (TON)
Significant Diagnostic Counterexamples in Probabilistic Model Checking
HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
Constructing the nearly shortest path in crossed cubes
Information Sciences: an International Journal
Design and performance analysis of an inductive QoS routing algorithm
Computer Communications
Efficiently Generating k-Best Solutions to Procurement Auctions
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
All maximal independent sets and dynamic dominance for sparse graphs
ACM Transactions on Algorithms (TALG)
Are very large n-best lists useful for SMT?
NAACL-Short '07 Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers
An Efficient Algorithm for the Shortest Path Problem with Forbidden Paths
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Energy-efficient routing for signal detection in wireless sensor networks
IEEE Transactions on Signal Processing
Finding Top-k Approximate Answers to Path Queries
FQAS '09 Proceedings of the 8th International Conference on Flexible Query Answering Systems
Optical switching in WDM networks: architectures and algorithms
ICOIN'09 Proceedings of the 23rd international conference on Information Networking
Finding next-to-shortest paths in a graph
Information Processing Letters
AINTEC '09 Asian Internet Engineering Conference
International Journal of Applied Mathematics and Computer Science
Collision-probability constrained PRM for a manipulator with base pose uncertainty
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Maximizing the Network Stability in Mobile WiMAX Mesh Networks
Mobile Networks and Applications
Policy-driven traffic engineering for intra-domain quality of service provisioning
QofIS'02/ICQT'02 Proceedings of the 3rd international conference on quality of future internet services and internet charging and QoS technologies 2nd international conference on From QoS provisioning to QoS charging
Counterexamples in probabilistic model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
A lazy version of Eppstein's K shortest paths algorithm
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
RECOMB'06 Proceedings of the joint 2006 satellite conference on Systems biology and computational proteomics
A robust routing plan to optimize throughput in core networks
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Providing evidence of likely being on time: counterexample generation for CTMC model checking
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Fault tolerance in networks with an advance reservation service
IWQoS'03 Proceedings of the 11th international conference on Quality of service
The K shortest transit paths choosing algorithm in stochastic transit network
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Can critical real-time services of public infrastructures run over ethernet and MPLS networks?
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Spectrum fusion: using multiple mass spectra for de novo peptide sequencing
RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the 2010 ICSE Workshop on Quantitative Stochastic Models in the Verification and Design of Software Systems
Approximation scheduling algorithms for solving multi-objects movement synchronization problem
ICANNGA'09 Proceedings of the 9th international conference on Adaptive and natural computing algorithms
A near-linear-time algorithm for computing replacement paths in planar directed graphs
ACM Transactions on Algorithms (TALG)
Cross optimization for RWA and regenerator placement in translucent WDM networks
ONDM'10 Proceedings of the 14th conference on Optical network design and modeling
Joint routing and scheduling in WiMAX-based mesh networks
IEEE Transactions on Wireless Communications
Topological reasoning between complex regions in databases with frequent updates
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Fast top-k simple shortest paths discovery in graphs
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Machine transliteration survey
ACM Computing Surveys (CSUR)
Proceedings of the 8th International Conference on Frontiers of Information Technology
Subgraphs generating algorithm for obtaining set of node-disjoint paths in terrain-based mesh graphs
MIG'10 Proceedings of the Third international conference on Motion in games
On the $k$ Shortest Simple Paths Problem in Weighted Directed Graphs
SIAM Journal on Computing
A new approach to optical networks security: attack-aware routing and wavelength assignment
IEEE/ACM Transactions on Networking (TON)
POMR: a power-aware interconnect optimization methodology
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Constrained de novo sequencing of peptides with application to conotoxins
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
Robust network planning in nonuniform traffic scenarios
Computer Communications
Image segmentation based on electrical proximity in a resistor-capacitor network
ACIVS'11 Proceedings of the 13th international conference on Advanced concepts for intelligent vision systems
An experimental study on approximating K shortest simple paths
ESA'11 Proceedings of the 19th European conference on Algorithms
Efficient associative algorithm for finding the second simple shortest paths in a digraph
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
Survivable multipath provisioning with differential delay constraint in telecom mesh networks
IEEE/ACM Transactions on Networking (TON)
K*: A heuristic search algorithm for finding the k shortest paths
Artificial Intelligence
Proceedings of the Second Symposium on Information and Communication Technology
Replacement paths and k simple shortest paths in unweighted directed graphs
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Finding the K shortest paths in a schedule-based transit network
Computers and Operations Research
English to persian transliteration
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
Link discovery in graphs derived from biological databases
DILS'06 Proceedings of the Third international conference on Data Integration in the Life Sciences
An overview of probabilistic tree transducers for natural language processing
CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Linear programming for phylogenetic reconstruction based on gene rearrangements
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
K-Shortest paths q-routing: a new QoS routing algorithm in telecommunication networks
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Gapped spectral dictionaries and their applications for database searches of tandem mass spectra
RECOMB'10 Proceedings of the 14th Annual international conference on Research in Computational Molecular Biology
Simulation-based deadlock avoidance and optimization in bidirectional AGVS
Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques
On the effective enumerability of NP problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Simple and fast inverse alignment
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
ViNEYard: virtual network embedding algorithms with coordinated node and link mapping
IEEE/ACM Transactions on Networking (TON)
The first K shortest unique-arc walks in a traffic-light network
Mathematical and Computer Modelling: An International Journal
Solving the k-shortest path problem with time windows in a time varying network
Operations Research Letters
Topology and routing optimization for congestion minimization in optical wireless networks
Optical Switching and Networking
Quantitative Analysis of Systems Using Game-Theoretic Learning
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on CAPA'09, Special Section on WHS'09, and Special Section VCPSS' 09
Replacement paths and k simple shortest paths in unweighted directed graphs
ACM Transactions on Algorithms (TALG)
Multi-description multipath video streaming in wireless ad hoc networks
Image Communication
Algorithms for generating ordered solutions for explicit and/or structures
Journal of Artificial Intelligence Research
Towards an optimized abstracted topology design in cloud environment
Future Generation Computer Systems
Deciding the twins property for weighted tree automata over extremal semifields
ATANLP '12 Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing
A linear time algorithm for the k maximal sums problem
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Towards probabilistic acceptors and transducers for feature structures
SSST-6 '12 Proceedings of the Sixth Workshop on Syntax, Semantics and Structure in Statistical Translation
A survey on proximity measures for social networks
Search Computing
Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication
ACM Transactions on Algorithms (TALG)
A state-dependent time evolving multi-constraint routing algorithm
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
A content aware and name based routing network speed up system
ICPCA/SWS'12 Proceedings of the 2012 international conference on Pervasive Computing and the Networked World
Two new economic models for privacy
ACM SIGMETRICS Performance Evaluation Review
A Neural-network Algorithm for All k Shortest Paths Problem
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Slice embedding solutions for distributed service architectures
ACM Computing Surveys (CSUR)
The next-to-shortest path in undirected graphs with nonnegative weights
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Finding the K shortest paths in a time-schedule network with constraints on arcs
Computers and Operations Research
Algorithms for generating ordered solutions for explicit AND/OR structures: extended abstract
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Photonic Network Communications
Computers and Operations Research
Discrete Applied Mathematics
| Hi-index | 0.01 |
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, maximum inscribed polygons, and genealogical relationship discovery.