Results 1  10
of
117
All Pairs Almost Shortest Paths
 SIAM Journal on Computing
, 1996
"... Let G = (V; E) be an unweighted undirected graph on n vertices. A simple argument shows that computing all distances in G with an additive onesided error of at most 1 is as hard as Boolean matrix multiplication. Building on recent work of Aingworth, Chekuri and Motwani, we describe g) time ..."
Abstract

Cited by 91 (7 self)
 Add to MetaCart
Let G = (V; E) be an unweighted undirected graph on n vertices. A simple argument shows that computing all distances in G with an additive onesided error of at most 1 is as hard as Boolean matrix multiplication. Building on recent work of Aingworth, Chekuri and Motwani, we describe g) time
A nearly optimal algorithm for approximating replacement paths and k shortest simple paths in general graphs
 In Proc. SODA
, 2010
"... Let G = (V, E) be a directed graph with positive edge weights, let s, t be two specified vertices in this graph, and let π(s, t) be the shortest path between them. In the replacement paths problem we want to compute, for every edge e on π(s, t), the shortest path from s to t that avoids e. The naive ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
weight. We also present an even faster (1 + ɛ) approximate algorithm for the simpler problem of approximating the k shortest simple s − t paths in a directed graph with positive edge weights. That is, our algorithm outputs k different simple s−t paths, where the kth path we output is a (1 + ɛ
Finding the k Shortest Simple Paths: A New Algorithm and its Implementation
"... We describe a new algorithm to enumerate the k shortest simple (loopless) paths in a directed graph and report on its implementation. Our algorithm is based on a replacement paths algorithm proposed recently by Hershberger and Suri [7], and can yield a factor #(n) improvement for this problem. But t ..."
Abstract

Cited by 27 (2 self)
 Add to MetaCart
We describe a new algorithm to enumerate the k shortest simple (loopless) paths in a directed graph and report on its implementation. Our algorithm is based on a replacement paths algorithm proposed recently by Hershberger and Suri [7], and can yield a factor #(n) improvement for this problem
Oracles for bounded length shortest paths in planar graphs
 ACM Trans. Algorithms
"... We present a new approach for answering short path queries in planar graphs. For any fixed constant k and a given unweighted planar graph G = (V, E) one can build in O(V ) time a data structure, which allows to check in O(1) time whether two given vertices are at distance at most k in G and if so ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We present a new approach for answering short path queries in planar graphs. For any fixed constant k and a given unweighted planar graph G = (V, E) one can build in O(V ) time a data structure, which allows to check in O(1) time whether two given vertices are at distance at most k in G and if so
A nearlinear time algorithm for computing replacement paths in planar directed graphs
 In Proc. 19th annual ACMSIAM symposium on Discrete algorithms
, 2008
"... Let G = (V (G), E(G)) be a weighted directed graph and let P be a shortest path from s to t in G. In the replacement paths problem we are required to compute for every edge e in P, the length of a shortest path from s to t that avoids e. The fastest known algorithm for solving the problem in weighte ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
motivated by two different applications. First, the fastest algorithm to compute the k simple shortest paths from s to t in directed graphs [21, 13] repeatedly computes the replacement paths from s to t. Its running time is O(kn(m + n log n)). Second, the computation of Vickrey pricing of edges
Online Maintenance of Visibility and ShortestPath Information
, 1994
"... Given a simple polygon P and a point p 2 P , we show how to maintain the visibility polygon from p, the shortest path tree from p, and the corresponding shortest path partition as p is translated inside P . Given a direction of motion of p, we can determine how far p can move until the first combin ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Given a simple polygon P and a point p 2 P , we show how to maintain the visibility polygon from p, the shortest path tree from p, and the corresponding shortest path partition as p is translated inside P . Given a direction of motion of p, we can determine how far p can move until the first
Replacement Paths via Row Minima of Concise Matrices
, 2014
"... Matrix M is kconcise if the finite entries of each column of M consist of k or fewer intervals of identical numbers. We give an O(n + m)time algorithm to compute the row minima of any O(1)concise n×m matrix. Our algorithm yields the first O(n+m)time reductions from the replacementpaths problem ..."
Abstract
 Add to MetaCart
problem on an nnode medge undirected graph (respectively, directed acyclic graph) to the singlesource shortestpaths problem on an O(n)node O(m)edge undirected graph (respectively, directed acyclic graph). That is, we prove that the replacementpaths problem is no harder than the single
A Simple Survey on Top K Paths Algorithms on FST
"... This article provides a survey on top k paths algorithms, especially focusing on how to apply these algorithms to finitestate transducers (FST). I would compare 3 algorithms that relate to the tree of paths, and 2 of them are implemented. 1. PROBLEM DEFINITION Our task is to enumerate top k shortest ..."
Abstract
 Add to MetaCart
shortest paths of a given FST as fast as possible. Before we actually look at the algorithms that find top k paths on a given graph, we should be aware of that an FST is a directed acyclic graph (DAG) with extra input and output labels attached to each edge, and it also has multiple edges between 2 nodes
Additive spanners: A simple construction
, 2014
"... We consider additive spanners of unweighted undirected graphs. Let G be a graph and H a subgraph of G. The most naïve way to construct an additive kspanner of G is the following: As long as H is not an additive kspanner repeat: Find a pair pu, vq P H that violates the spannercondition and a short ..."
Abstract
 Add to MetaCart
shortest path from u to v in G. Add the edges of this path to H. We show that, with a very simple initial graph H, this naïve method gives additive 6 and 2spanners of sizes matching the best known upper bounds. For additive 2spanners we start with H “ H and end with Opn3{2q edges in the spanner
Whom You Know Matters: Venture Capital Networks and Investment Performance,
 Journal of Finance
, 2007
"... Abstract Many financial markets are characterized by strong relationships and networks, rather than arm'slength, spotmarket transactions. We examine the performance consequences of this organizational choice in the context of relationships established when VCs syndicate portfolio company inv ..."
Abstract

Cited by 138 (8 self)
 Add to MetaCart
the results reported in the following sections utilize the binary matrix, we note that all our results are robust to using network centrality measures calculated from valued matrices. 6 Unlike the undirected matrix, the directed matrix does not record a tie between VCs j and k who were members of the same
Results 1  10
of
117