Up a level |
Bansal, Ishan, Cheriyan, Joseph, Grout, Logan and Ibrahimpur, Sharat (2024) Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions. Algorithmica, 86 (8). 2575 - 2604. ISSN 0178-4617
Bansal, Ishan, Cheriyan, Joseph, Grout, Logan and Ibrahimpur, Sharat (2023) Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions. In: Etessami, Kousha, Feige, Uriel and Puppis, Gabriele, (eds.) 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023. Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. ISBN 9783959772785
Boyd, Sylvia, Cheriyan, Joseph, Haddadan, Arash and Ibrahimpur, Sharat (2023) Approximation algorithms for flexible graph connectivity. Mathematical Programming. ISSN 0025-5610
Cheriyan, Joseph and Végh, László A. ORCID: 0000-0003-1152-200X (2014) Approximating minimum-cost -node connected subgraphs via independence-free graphs. SIAM Journal on Computing, 43 (4). pp. 1342-1362. ISSN 0097-5397
Cheriyan, Joseph and Végh, László A. ORCID: 0000-0003-1152-200X (2013) Approximating minimum-cost k-node connected subgraphs via independence-free graphs. In: FOCS 2013 - 54th Annual Symposium on Foundations of Computer Science, 2013-10-27 - 2013-10-29, Berkeley CA, United States, USA.