Travelled to:1 × Canada
1 × Latvia
3 × USA
Collaborated with:R.Thurimella A.Vetta S.Vempala T.Hagerup K.Mehlhorn Z.Gao K.Georgiou S.Singla
Talks about:algorithm (4) connect (3) approxim (2) vertex (2) cost (2) hierarchi (1) subgraph (1) shredder (1) parallel (1) asymmetr (1)
Person: Joseph Cheriyan
DBLP: Cheriyan:Joseph
Contributed to:
2013
20052002199619911990Wrote 6 papers:
- ICALP-v1-2013-CheriyanGGS #on the #symmetry
- On Integrality Ratios for Asymmetric TSP in the Sherali-Adams Hierarchy (JC, ZG, KG, SS), pp. 340–351.
- STOC-2005-CheriyanV #algorithm #approximate #design #metric #network
- Approximation algorithms for network design with metric costs (JC, AV), pp. 167–175.
- STOC-2002-CheriyanVV #algorithm #approximate #low cost
- Approximation algorithms for minimum-cost k-vertex connected subgraphs (JC, SV, AV), pp. 306–312.
- STOC-1996-CheriyanT #algorithm #performance
- Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation (JC, RT), pp. 37–46.
- STOC-1991-CheriyanT #algorithm #parallel
- Algorithms for Parallel k-Vertex Connectivity and Sparse Certificates (JC, RT), pp. 391–401.
- ICALP-1990-CheriyanHM #question
- Can A Maximum Flow be Computed on o(nm) Time? (JC, TH, KM), pp. 235–248.