Efficient Algorithms for k-Disjoint Paths Problems on DAGs (original) (raw)

Finding disjoint paths with different path‐costs: Complexity and algorithms

Chung Li

Networks, 1992

View PDFchevron_right

On the disjoint paths problem

Thanh Nguyên Nguyen

Operations Research Letters, 2007

View PDFchevron_right

A quick method for finding shortest pairs of disjoint paths

Robert Tarjan

Networks, 1984

View PDFchevron_right

Improved approximation algorithms for computing k$$ k disjoint paths subject to two constraints

Kewen Liao

Journal of Combinatorial Optimization, 2013

View PDFchevron_right

The complexity of finding two disjoint paths with min-max objective function

Chung Li

Discrete Applied Mathematics, 1990

View PDFchevron_right

Commentary - Methods to find all the edges on any of the shortest paths between two given nodes of a directed acyclic graph

Omkar Jadhav

Research Ideas and Outcomes

View PDFchevron_right

Shortest k-Disjoint Paths via Determinants

Anish Mukherjee

ArXiv, 2018

View PDFchevron_right

The k shortest paths problem

Jose Renato Calixto Dos Santos

1998

View PDFchevron_right

Efficient Approximation Algorithms for Computing k Disjoint Restricted Shortest Paths

Kewen Liao

Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures, 2015

View PDFchevron_right

An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs

Mehmet Karaata

Journal of Computing and Information Technology

View PDFchevron_right

Min-Sum 2-Paths Problems

T. Fenner

Theory of Computing Systems, 2014

View PDFchevron_right

Finding Arc and Vertex-Disjoint Paths in Networks

Jun ZHANG

2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing, 2009

View PDFchevron_right

On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths

Julio Araujo

Algorithmica, 2019

View PDFchevron_right

Decomposing DAGs into Disjoint Chains

Yangjun Chen

Lecture Notes in Computer Science, 2007

View PDFchevron_right

A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths

Kewen Liao

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

View PDFchevron_right

Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph

Yehoshua Perl

Journal of the ACM, 1978

View PDFchevron_right

Finding disjoint paths in networks

Deepinder Sidhu

ACM SIGCOMM Computer Communication Review, 1991

View PDFchevron_right

One-to-many node-disjoint paths in (n, k)-star graphs

Yonghong Xiang

Discrete Applied Mathematics, 2010

View PDFchevron_right

Edge-disjoint paths revisited

Sampath Kannan

ACM Transactions on Algorithms, 2007

View PDFchevron_right

Finding k -dissimilar paths with minimum collective length

Johann Gamper

Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2018

View PDFchevron_right

Finding k-shortest paths with limited overlap

Johann Gamper

The VLDB Journal

View PDFchevron_right

A heuristic to generate all best partially disjoint paths in a communications network

Alexander A Kist

The 8th International Conference on Communication Systems, 2002. ICCS 2002., 2002

View PDFchevron_right

Scheme to Find k Disjoint Paths in Multi-Cost

Naoto Kishi

2011 IEEE International Conference on Communications (ICC), 2011

View PDFchevron_right

A linear-time algorithm for edge-disjoint paths in planar graphs

Karsten Weihe

Combinatorica, 1995

View PDFchevron_right

Algorithms for determining a node-disjoint path pair visiting specified nodes

David Tipper

Optical Switching and Networking, 2016

View PDFchevron_right

Routing with congestion in acyclic digraphs

Saeed Amiri

Information Processing Letters, 2019

View PDFchevron_right

A linear programming formulation of Mader's edge-disjoint paths problem

Judith Keijsper

Journal of Combinatorial Theory, Series B, 2006

View PDFchevron_right

Algorithms for finding internally disjoint paths in a planar graph

Takao Nishizeki

Electronics and Communications in Japan (Part III: Fundamental Electronic Science), 1989

View PDFchevron_right

Efficient heuristics for determining node-disjoint path pairs visiting specified nodes

David Tipper

Networks, 2017

View PDFchevron_right