AbstractThis paper shows that the FPTAS for the min–max disjoint paths problem on directed acyclic graphs by Yu et al. (2010) [7] can be improved by a rounding and searching technique
AbstractGiven a network G = (V,E) and two vertices s and t, we consider the problem of finding two d...
The maximum edge-disjoint path problem (MEDP) is one of the most classical NP-hard problems [5]. We ...
Shortest path problems can be solved very efficiently when a directed graph is nearly acyclic. Earl...
AbstractThis paper is composed of two parts. In the first part, an improved algorithm is presented f...
Given a graph G=(V, E) and k source-sink pairs (s1, t1), …, (sk, tk) with each si, ti V...
We study the classical NP-hard problems of finding maximum-size subsets from given sets of k termina...
AbstractGiven an edge-weighted (di)graph and a list of source–sink pairs of vertices of this graph, ...
[[abstract]]This paper is composed of two parts. In the first part, an improved algorithm is present...
AbstractThe min–min problem of finding a disjoint path pair with the length of the shorter path mini...
The approximability of the maximum edge disjoint paths problem (EDP) in directed graphs was seemingl...
We show that, for any graph optimization problem in which the feasible solutions can be expressed by...
AbstractFor a graph G and a collection of vertex pairs {(s1,t1),…,(sk,tk)}, the k disjoint paths pro...
AbstractA simple algorithmic proof of a min–max theorem of E. Győri on generators of path sy...
AbstractShortest path problems can be solved very efficiently when a directed graph is nearly acycli...
AbstractWe give a dual pair of linear programs for a min–max result of Mader describing the maximum ...
AbstractGiven a network G = (V,E) and two vertices s and t, we consider the problem of finding two d...
The maximum edge-disjoint path problem (MEDP) is one of the most classical NP-hard problems [5]. We ...
Shortest path problems can be solved very efficiently when a directed graph is nearly acyclic. Earl...
AbstractThis paper is composed of two parts. In the first part, an improved algorithm is presented f...
Given a graph G=(V, E) and k source-sink pairs (s1, t1), …, (sk, tk) with each si, ti V...
We study the classical NP-hard problems of finding maximum-size subsets from given sets of k termina...
AbstractGiven an edge-weighted (di)graph and a list of source–sink pairs of vertices of this graph, ...
[[abstract]]This paper is composed of two parts. In the first part, an improved algorithm is present...
AbstractThe min–min problem of finding a disjoint path pair with the length of the shorter path mini...
The approximability of the maximum edge disjoint paths problem (EDP) in directed graphs was seemingl...
We show that, for any graph optimization problem in which the feasible solutions can be expressed by...
AbstractFor a graph G and a collection of vertex pairs {(s1,t1),…,(sk,tk)}, the k disjoint paths pro...
AbstractA simple algorithmic proof of a min–max theorem of E. Győri on generators of path sy...
AbstractShortest path problems can be solved very efficiently when a directed graph is nearly acycli...
AbstractWe give a dual pair of linear programs for a min–max result of Mader describing the maximum ...
AbstractGiven a network G = (V,E) and two vertices s and t, we consider the problem of finding two d...
The maximum edge-disjoint path problem (MEDP) is one of the most classical NP-hard problems [5]. We ...
Shortest path problems can be solved very efficiently when a directed graph is nearly acyclic. Earl...
DOI
Add to ORKG