Provan J. Scott

J. Scott Provan

Information about the author J. Scott Provan will soon be added to the site.
Found 8 papers in total
On the structure and complexity of the 2-connected Steiner network problem in the plane
On the structure and complexity of the 2-connected Steiner network problem in the plane
2000
We consider the problem of finding a minimum Euclidean length graph 2-connecting a set...
Calculating K-connectedness reliability using Steiner bounds
Calculating K-connectedness reliability using Steiner bounds
1996
The K -connectedness reliability problem considered in this paper has as input...
A polynomial-time algorithm to find shortest paths with recourse
A polynomial-time algorithm to find shortest paths with recourse
2003
The Shortest Path with Recourse Problem involves finding the shortest expected-length...
The Delta–Wye approximation procedure for two-terminal reliability
The Delta–Wye approximation procedure for two-terminal reliability
1996
The Delta–Wye Approximation Procedure (DWAP) is a procedure for estimating the...
Minimal connected enclosures on an embedded planar graph
Minimal connected enclosures on an embedded planar graph
1999
We study five problems of finding minimal enclosures comprised of elements of a...
On finding two-connected subgraphs in planar graphs
On finding two-connected subgraphs in planar graphs
1997
We consider a basic problem in the design of reliable networks, namely, that of...
Efficient enumeration of the vertices of polyhedra associated with network LPs
Efficient enumeration of the vertices of polyhedra associated with network LPs
1994
Algorithms are given to list the vertices of polyhedra associated with network linear...
The role of Steiner hulls in the solution to Steiner tree problems
The role of Steiner hulls in the solution to Steiner tree problems
1991
A Steiner tree problem on the plane is that of finding a minimum length Steiner tree...
Papers per page: