L. Shankar Ram

15 papers A 1B 5Misc 1Journal 7Unranked 1
YearRankTypeTitle / Venue / Authors
2009 J jnl
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems.
Algorithmica
Bodo Manthey, L. Shankar Ram
2009 J jnl
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems.
Oper. Res. Lett.
Markus Bläser, L. Shankar Ram, Maxim Sviridenko
2008 J jnl
Approximately Fair Cost Allocation in Metric Traveling Salesman Games.
Theory Comput. Syst.
Markus Bläser, L. Shankar Ram
2007 J jnl
On the relationship between ATSP and the cycle cover problem.
Theor. Comput. Sci.
L. Sunil Chandran, L. Shankar Ram
2006 J jnl
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
CoRR
Bodo Manthey, L. Shankar Ram
2006 B conf
Approximation Algorithms for Multi-criteria Traveling Salesman Problems.
WAOA
Bodo Manthey, L. Shankar Ram
2006 J jnl
Network Discovery and Verification.
IEEE J. Sel. Areas Commun.
Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram
2005 B conf
An Improved Approximation Algorithm for TSP with Distances One and Two.
FCT
Markus Bläser, L. Shankar Ram
2005 B conf
Approximate Fair Cost Allocation in Metric Traveling Salesman Games.
WAOA
Markus Bläser, L. Shankar Ram
2005 B conf
Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems.
WADS
Markus Bläser, L. Shankar Ram, Maxim Sviridenko
2005 — conf
Network Discovery and Verification.
Algorithms for Optimization with Incomplete Information
Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram
2005 B conf
Network Discovery and Verification.
WG
Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram
2004 J jnl
On the Number of Minimum Cuts in a Graph.
SIAM J. Discret. Math.
L. Sunil Chandran, L. Shankar Ram
2002 A conf
Approximations for ATSP with Parametrized Triangle Inequality.
STACS
L. Sunil Chandran, L. Shankar Ram
2002 Misc conf
On the Number of Minimum Cuts in a Graph.
COCOON
L. Sunil Chandran, L. Shankar Ram