Æȷοì
Euiwoong Lee
Á¦¸ñ
Àοë
Àοë
¿¬µµ
Improved and simplified inapproximability for k-means
E Lee, M Schmidt, J Wright
Information Processing Letters 120, 40-43, 2017
1082017
APX-hardness of maximizing Nash social welfare with indivisible items
E Lee
Information Processing Letters 122, 17-20, 2017
1032017
Tight FPT Approximations for -Median and -Means
V Cohen-Addad, A Gupta, A Kumar, E Lee, J Li
arXiv preprint arXiv:1904.12334, 2019
742019
Optimal online contention resolution schemes via ex-ante prophet inequalities
E Lee, S Singla
arXiv preprint arXiv:1806.09251, 2018
682018
A survey on approximation in parameterized complexity: Hardness and algorithms
AE Feldmann, KC S, E Lee, P Manurangsi
Algorithms 13 (6), 146, 2020
662020
Partitioning a graph into small pieces with applications to path transversal
E Lee
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete ¡¦, 2017
652017
A PTAS for §¤p-Low Rank Approximation
F Ban, V Bhattiprolu, K Bringmann, P Kolev, E Lee, DP Woodruff
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete ¡¦, 2019
532019
Sum-of-squares certificates for maxima of random tensors on the sphere
V Bhattiprolu, V Guruswami, E Lee
arXiv preprint arXiv:1605.00903, 2016
42*2016
Inapproximability of H-Transversal/Packing
V Guruswami, E Lee
Proceedings of the 18th International Workshop on Approximation Algorithms ¡¦, 2015
42*2015
Faster exact and approximate algorithms for k-cut
A Gupta, E Lee, J Li
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS ¡¦, 2018
402018
An FPT Algorithm Beating 2-Approximation for k-Cut
A Gupta, E Lee, J Li
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete ¡¦, 2018
382018
Strong inapproximability results on balanced rainbow-colorable hypergraphs
V Guruswami, E Lee
Combinatorica 38 (3), 547-599, 2018
372018
Improved hardness for cut, interdiction, and firefighter problems
E Lee
arXiv preprint arXiv:1607.05133, 2016
322016
Losing treewidth by separating subsets
A Gupta, E Lee, J Li, P Manurangsi, M W©©odarczyk
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete ¡¦, 2019
292019
Improved bounds on the price of stability in network cost sharing games
E Lee, K Ligett
Proceedings of the fourteenth ACM conference on Electronic commerce, 607-620, 2013
292013
On approximability of clustering problems without candidate centers
V Cohen-Addad, CS Karthik, E Lee
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA ¡¦, 2021
282021
Maximum matching in the online batch-arrival model
E Lee, S Singla
ACM Transactions on Algorithms (TALG) 16 (4), 1-31, 2020
252020
Weak Decoupling, Polynomial Folds and Approximate Optimization over the Sphere
V Bhattiprolu, M Ghosh, V Guruswami, E Lee, M Tulsiani
Foundations of Computer Science (FOCS), 2017 IEEE 58th Annual Symposium on ¡¦, 2017
25*2017
Correlation clustering with sherali-adams
V Cohen-Addad, E Lee, A Newman
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS ¡¦, 2022
242022
Tri-fly: Distributed estimation of global and local triangle counts in graph streams
K Shin, M Hammoud, E Lee, J Oh, C Faloutsos
Pacific-Asia Conference on Knowledge Discovery and Data Mining, 651-663, 2018
212018
ÇöÀç ½Ã½ºÅÛÀÌ ÀÛµ¿µÇÁö ¾Ê½À´Ï´Ù. ³ªÁß¿¡ ´Ù½Ã ½ÃµµÇØ ÁÖ¼¼¿ä.
ÇмúÀÚ·á 1–20