L. Shankar Ram

According to our database, L. Shankar Ram authored at least 9 papers between 2002 and 2009.

Collaborative distances:

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

2009

Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems.

Markus Bläser, L. Shankar Ram, Maxim Sviridenko

Oper. Res. Lett., 2009

Approximation Algorithms for Multi-Criteria Traveling Salesman Problems.

Bodo Manthey, L. Shankar Ram

Algorithmica, 2009

2008

Approximately Fair Cost Allocation in Metric Traveling Salesman Games.

Markus Bläser, L. Shankar Ram

Theory Comput. Syst., 2008

2007

On the relationship between ATSP and the cycle cover problem.

L. Sunil Chandran, L. Shankar Ram

Theor. Comput. Sci., 2007

2006

Network Discovery and Verification.

Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram

IEEE J. Sel. Areas Commun., 2006

2005

Approximate Fair Cost Allocation in Metric Traveling Salesman Games.

Markus Bläser, L. Shankar Ram

Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

An Improved Approximation Algorithm for TSP with Distances One and Two.

Markus Bläser, L. Shankar Ram

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004

On the Number of Minimum Cuts in a Graph.

L. Sunil Chandran, L. Shankar Ram

SIAM J. Discret. Math., 2004

2002

Approximations for ATSP with Parametrized Triangle Inequality.

L. Sunil Chandran, L. Shankar Ram

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002