Cheriyan J

J Cheriyan

Information about the author J Cheriyan will soon be added to the site.
Found 3 papers in total
Approximation Algorithms and Hardness Results for Packing Element‐Disjoint Steiner Trees in Planar Graphs
Approximation Algorithms and Hardness Results for Packing Element‐Disjoint Steiner Trees in Planar Graphs
2012
We study the problem of packing element‐disjoint Steiner trees in graphs. We...
On Rooted Node‐Connectivity Problems
On Rooted Node‐Connectivity Problems
2001
Let G be a graph which is k ‐outconnected from a specified root node r , that...
On the integrality ratio for tree augmentation
On the integrality ratio for tree augmentation
2008
We show that the standard linear programming relaxation for the tree augmentation...
Papers per page: