#### Filter Results:

#### Publication Year

1995

2007

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Path restoration scheme can be used in augmenting existing telecommunication networks with adequate spare capacity to achieve a desired level of protection against link failures. Path restoration planning corresponds to the multi{commodity ow problem, which is computationally hard. In this paper, we present the details of an approximation scheme for the… (More)

Path restoration scheme can be used i n augmenting existing telecommunication networks with adequate spare capacity t o achieve a desired level of protection against link failures. Path restoration planning corresponds t o the multi-commodity flow problem, which is computationally hard. In this paper, we present the details of an approximation scheme f o r… (More)

The mixed postman problem, a generalization of the Chinese postman problem, is that of nding a shortest tour that traverses each edge of a given mixed graph (a graph containing both undirected and directed edges) at least once. The problem is solvable in polynomial time either if the graph is undirected or if the graph is directed, but NP-hard in mixed… (More)

The asymmetric postman problem is a generalization of the Chinese postman problem in which the edge-traversal costs are asymmetric. The problem is to compute a shortest tour that traverses every edge of a given graph at least once, and it is known to be NP-hard. An approximation algorithm with a performance ratio of $ for the asymmetric postman problem is… (More)

We analyze a solution to a variant of the Towers of Hanoi problem, in which multiple spare pegs are used to move the disks from the source to the destination peg. We also discuss the interesting relation between the number of disks and the total number of disk moves when the number of spare pegs is a function of number of disks.

- ‹
- 1
- ›