Euiwoong Lee
Titolo
Citata da
Citata da
Anno
Improved and simplified inapproximability for k-means
E Lee, M Schmidt, J Wright
Information Processing Letters 120, 40-43, 2017
662017
APX-hardness of maximizing Nash social welfare with indivisible items
E Lee
Information Processing Letters 122, 17-20, 2017
522017
Inapproximability of H-Transversal/Packing
V Guruswami, E Lee
Proceedings of the 18th International Workshop on Approximation Algorithms …, 2015
32*2015
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
312019
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
312017
Sum-of-squares certificates for maxima of random tensors on the sphere
V Bhattiprolu, V Guruswami, E Lee
arXiv preprint arXiv:1605.00903, 2016
30*2016
Strong inapproximability results on balanced rainbow-colorable hypergraphs
V Guruswami, E Lee
Combinatorica 38 (3), 547-599, 2018
292018
Optimal online contention resolution schemes via ex-ante prophet inequalities
E Lee, S Singla
arXiv preprint arXiv:1806.09251, 2018
262018
Improved hardness for cut, interdiction, and firefighter problems
E Lee
arXiv preprint arXiv:1607.05133, 2016
242016
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
242013
Tight FPT Approximations for -Median and -Means
V Cohen-Addad, A Gupta, A Kumar, E Lee, J Li
arXiv preprint arXiv:1904.12334, 2019
212019
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
212018
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
20*2017
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
182018
Maximum matching in the online batch-arrival model
E Lee, S Singla
ACM Transactions on Algorithms (TALG) 16 (4), 1-31, 2020
142020
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
142019
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
142018
Minimum birkhoff-von neumann decomposition
J Kulkarni, E Lee, M Singh
International Conference on Integer Programming and Combinatorial …, 2017
122017
Bisect and conquer: Hierarchical clustering via max-uncut bisection
S Ahmadian, V Chatziafratis, A Epasto, E Lee, M Mahdian, K Makarychev, ...
arXiv preprint arXiv:1912.06983, 2019
102019
The number of minimum k-cuts: improving the Karger-Stein bound
A Gupta, E Lee, J Li
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
102019
Il sistema al momento non puň eseguire l'operazione. Riprova piů tardi.
Articoli 1–20