12 citations · 30 across the 17 of their papers we have counts for
4 papers · 1 filter
Unconstrained Traveling Tournament Problem is APX-complete
Salomon Bendayan, Joseph Cheriyan, Kevin K. H. Cheung
We show that the Unconstrained Traveling Tournament Problem (UTTP) is APX-complete by presenting an L-reduction from a version of metric (1,2)-TSP to UTTP. Keywords: Traveling Tour…
Extensions of the -Flexible-Graph-Connectivity model
Ishan Bansal, Joseph Cheriyan, Logan Grout +1
We present approximation algorithms for network design problems in some models related to the -FGC model. Adjiashvili, Hommelsheim and Mühlenthaler introduced the model of F…
Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions
Ishan Bansal, Joseph Cheriyan, Logan Grout +1
We address long-standing open questions raised by Williamson, Goemans, Vazirani and Mihail pertaining to the design of approximation algorithms for problems in network design via t…
Algorithms for 2-connected network design and flexible Steiner trees with a constant number of terminals
Ishan Bansal, Joe Cheriyan, Logan Grout +1
The -Steiner-2NCS problem is as follows: Given a constant , and an undirected connected graph , non-negative costs on , and a partition of in…