Jeyakesavan Veerasamy

According to our database, Jeyakesavan Veerasamy authored at least 5 papers between 1995 and 1999.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1999

A 3/2-Approximation Algorithm for the Mixed Postman Problem.

Balaji Raghavachari, Jeyakesavan Veerasamy

SIAM J. Discret. Math., 1999

Spare capacity assignment in telecom networks using path restoration and further improvement using traffic splitting.

Jeyakesavan Veerasamy, S. Venkatesan, Jay C. Shah

J. Syst. Softw., 1999

Approximation Algorithms for the Asymmetric Postman Problem.

Balaji Raghavachari, Jeyakesavan Veerasamy

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

Approximation Algorithms for the Mixed Postman Problem.

Balaji Raghavachari, Jeyakesavan Veerasamy

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1995

Spare Capacity Assignment in Telecom Networks Using Path Restoration.

Jeyakesavan Veerasamy, S. Venkatesan, Jay C. Shah

Proceedings of the MASCOTS '95, 1995