#### Filter Results:

- Full text PDF available (4)

#### Publication Year

1995

2007

- This year (0)
- Last 5 years (0)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Balaji Raghavachari, Jeyakesavan Veerasamy
- SIAM J. Discrete Math.
- 1999

- Balaji Raghavachari, Jeyakesavan Veerasamy
- IPCO
- 1998

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)

- Jeyakesavan Veerasamy, S. Venkatesan, Jay C. Shah
- Journal of Systems and Software
- 1995

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

- Balaji Raghavachari, Jeyakesavan Veerasamy
- SODA
- 1999

The asymmetric postman problem is a generalization of the Chinese postman problem in which the edgetraversal 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 NPhard. An approximation algorithm with a performance ratio of $ for the asymmetric postman problem is… (More)

Link restoration and path restoration are the two major techniques used for telecom network restoration in DCS (Digital Cross-connect System) mesh networks. For rerouting to be possible, su cient spare capacity must exist in the links of the chosen alternate paths. Path restoration results in lower additional cost compared to link restoration. Tra c… (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
- ›