186 citations · 243 across the 28 of their papers we have counts for
Showing 2002Show all
2 papers · 1 filter
cs.DS2002★ 1 cited
Linear-Time Pointer-Machine Algorithms for Path-Evaluation Problems on Trees and Graphs
Adam L. Buchsbaum, Loukas Georgiadis, Haim Kaplan +3
We present algorithms that run in linear time on pointer machines for a collection of problems, each of which either directly or indirectly requires the evaluation of a function de…
cs.DS2002★ 186 cited
Faster Parametric Shortest Path and Minimum Balance Algorithms
Neal Young, Robert Tarjan, James Orlin
The parametric shortest path problem is to find the shortest paths in graph where the edge costs are of the form w_ij+lambda where each w_ij is constant and lambda is a parameter t…