Travelled to:1 × Denmark
6 × USA
Collaborated with:K.Makarychev M.Charikar A.Vijayaraghavan A.Kolla A.Saberi S.Teng A.Agarwal N.Alon A.Naor
Talks about:algorithm (3) approxim (3) cut (3) problem (2) partit (2) optim (2) graph (2) near (2) min (2) ultrasparsifi (1)
Person: Yury Makarychev
DBLP: Makarychev:Yury
Contributed to:
2014
201420122010200920062005Wrote 8 papers:
- ICALP-v1-2014-MakarychevM #clustering #graph
- Nonuniform Graph Partitioning with Unrelated Weights (KM, YM), pp. 812–822.
- STOC-2014-MakarychevMV #approximate #constant
- Constant factor approximation for balanced cut in the PIE model (KM, YM, AV), pp. 41–49.
- STOC-2012-MakarychevMV #algorithm #approximate #clustering #problem
- Approximation algorithms for semi-random partitioning problems (KM, YM, AV), pp. 367–384.
- STOC-2010-KollaMST
- Subgraph sparsification and nearly optimal ultrasparsifiers (AK, YM, AS, SHT), pp. 57–66.
- STOC-2009-CharikarMM
- Integrality gaps for Sherali-Adams relaxations (MC, KM, YM), pp. 283–292.
- STOC-2006-CharikarMM #algorithm #game studies
- Near-optimal algorithms for unique games (MC, KM, YM), pp. 205–214.
- STOC-2005-AgarwalCMM #algorithm #approximate #problem
- O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems (AA, MC, KM, YM), pp. 573–581.
- STOC-2005-AlonMMN #graph #polynomial
- Quadratic forms on graphs (NA, KM, YM, AN), pp. 486–493.