activity
20112025
most citedA hierarchy of eigencomputations for polynomial optimization on the sphere

1 citations · 1 across the 6 of their papers we have counts for

collaborators
Showing 2011Show all

1 paper · 1 filter

cs.DS2011

Approximation Algorithms and Hardness of the k-Route Cut Problem

Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan +1

We study the k-route cut problem: given an undirected edge-weighted graph G=(V,E), a collection {(s_1,t_1),(s_2,t_2),...,(s_r,t_r)} of source-sink pairs, and an integer connectivit…