AbstractWe show that the shortest path problem cannot be solved in o(logn) time on an unbounded fan-in PRAM without bit operations using poly(n) processors, even when the bit-lengths of the weights on the edges are restricted to be of size O(log3n). This shows that the matrix-based repeated squaring algorithm for the shortest path problem is optimal in the unbounded fan-in PRAM model without bit operations
By restricting weight functions to satisfy the quadrangle inequality or the inverse quadrangle inequ...
Given a directed graph whose arcs have an associated cost, and associated weight, the weight constra...
We consider parallel random access machines (PRAM's) with p processors and distributed systems of ra...
We show that the shortest path problem cannot be solved in o(log n) time on an unbounded fan-in PRAM...
AbstractWe show that the shortest path problem cannot be solved in o(logn) time on an unbounded fan-...
We define a natural and realistic model of parallel computation called the PRAM model without bit op...
Ibrahim et al. (Int Trans Oper Res 16:361–369, 2009) presented and analyzed two integer programming ...
The Bottleneck Shortest Path Problem is a basic problem in network optimization. The goal is to dete...
We consider the variant of the shortest path problem in which a given set of paths is forbidden to o...
The single source shortest path (SSSP) problem lacks parallel solutions which are fast and simultane...
The shortest path problem is one of the classic network problems. The objective of this problem is t...
We present the rst lower bounds for shortest path problems (in-cluding euclidean shortest path) in t...
Abstract. The shortest-paths problem is a fundamental problem in graph theory and finds diverse appl...
Shortest path problems are fundamental network optimization problems arising in many contexts and ha...
The single source shortest path (SSSP) problem lacks parallel solutions which are fast and simultan...
By restricting weight functions to satisfy the quadrangle inequality or the inverse quadrangle inequ...
Given a directed graph whose arcs have an associated cost, and associated weight, the weight constra...
We consider parallel random access machines (PRAM's) with p processors and distributed systems of ra...
We show that the shortest path problem cannot be solved in o(log n) time on an unbounded fan-in PRAM...
AbstractWe show that the shortest path problem cannot be solved in o(logn) time on an unbounded fan-...
We define a natural and realistic model of parallel computation called the PRAM model without bit op...
Ibrahim et al. (Int Trans Oper Res 16:361–369, 2009) presented and analyzed two integer programming ...
The Bottleneck Shortest Path Problem is a basic problem in network optimization. The goal is to dete...
We consider the variant of the shortest path problem in which a given set of paths is forbidden to o...
The single source shortest path (SSSP) problem lacks parallel solutions which are fast and simultane...
The shortest path problem is one of the classic network problems. The objective of this problem is t...
We present the rst lower bounds for shortest path problems (in-cluding euclidean shortest path) in t...
Abstract. The shortest-paths problem is a fundamental problem in graph theory and finds diverse appl...
Shortest path problems are fundamental network optimization problems arising in many contexts and ha...
The single source shortest path (SSSP) problem lacks parallel solutions which are fast and simultan...
By restricting weight functions to satisfy the quadrangle inequality or the inverse quadrangle inequ...
Given a directed graph whose arcs have an associated cost, and associated weight, the weight constra...
We consider parallel random access machines (PRAM's) with p processors and distributed systems of ra...
DOI
Add to ORKG