#### Filter Results:

#### Publication Year

1995

1999

#### Co-author

#### Key Phrase

#### Publication Venue

Learn 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 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)

- ‹
- 1
- ›