The following pages link to Joseph Cheriyan (Q294661):
Displaying 8 items.
- (Q208487) (redirect page) (← links)
- An analysis of the highest-level selection rule in the preflow-push max-flow algorithm (Q294662) (← links)
- Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation (Q4939604) (← links)
- Unconstrained traveling tournament problem is APX-complete (Q6047703) (← links)
- A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case (Q6058192) (← links)
- On a partition LP relaxation for min-cost 2-node connected spanning subgraphs (Q6106538) (← links)
- Approximation algorithms for flexible graph connectivity (Q6120848) (← links)
- (Q6147541) (← links)
