Travelled to:1 × Canada
3 × USA
Collaborated with:M.Singh T.C.Kwok H.Y.Cheung J.Naor M.R.Salavatipour Y.T.Lee S.O.Gharan L.Trevisan
Talks about:degre (3) algorithm (2) spectral (2) approxim (2) network (2) surviv (2) design (2) order (2) bound (2) constraint (1)
Person: Lap Chi Lau
DBLP: Lau:Lap_Chi
Contributed to:
2013201220082007Wrote 5 papers:
- STOC-2013-KwokLLGT #algorithm #analysis #clustering #difference #higher-order
- Improved Cheeger’s inequality: analysis of spectral partitioning algorithms through higher order spectral gap (TCK, LCL, YTL, SOG, LT), pp. 11–20.
- STOC-2012-CheungKL #algorithm #matrix #performance #rank
- Fast matrix rank algorithms and applications (HYC, TCK, LCL), pp. 549–562.
- STOC-2008-LauS #approximate #bound #design #network
- Additive approximation for bounded degree survivable network design (LCL, MS), pp. 759–768.
- STOC-2007-LauNSS #constraints #design #network #order
- Survivable network design with degree or order constraints (LCL, JN, MRS, MS), pp. 651–660.
- STOC-2007-SinghL #approximate #bound
- Approximating minimum bounded degree spanning trees to within one of optimal (MS, LCL), pp. 661–670.