Travelled to:
1 × Canada
1 × France
1 × Japan
1 × USA
1 × United Kingdom
Collaborated with:
S.Khot V.Guruswami I.L.Gørtz V.Nagarajan N.R.Devanur N.K.Vishnoi
Talks about:
inapproxim (1) hypergraph (1) intersect (1) stochast (1) sparsest (1) halfspac (1) approxim (1) uniform (1) recours (1) problem (1)
Person: Rishi Saket
DBLP: Saket:Rishi
Contributed to:
Wrote 5 papers:
- ICALP-v1-2015-KhotS #approximate #using
- Approximating CSPs Using LP Relaxation (SK, RS), pp. 822–833.
- ICALP-v1-2012-GortzNS #probability
- Stochastic Vehicle Routing with Recourse (ILG, VN, RS), pp. 411–423.
- ICALP-v1-2010-GuruswamiS #on the
- On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs (VG, RS), pp. 360–371.
- STOC-2008-KhotS #learning #on the
- On hardness of learning intersection of two halfspaces (SK, RS), pp. 345–354.
- STOC-2006-DevanurKSV #linear #problem
- Integrality gaps for sparsest cut and minimum linear arrangement problems (NRD, SK, RS, NKV), pp. 537–546.