Profiles2021-2026
Euiwoong Lee
University of Michigan
14Papers
5Last author
26Unique co-authors
1First author
0Solo
First and last author come from byline position, which some venues assign alphabetically.
Recent papers14
- Combinatorial Optimization using Comparison OraclesAuthor 5 of 11STOC 2026 · 2 citations
- Improved Approximation Algorithms for Chromatic and Pseudometric-Weighted Correlation ClusteringAuthor 3 of 3NeurIPS 2025 · 6 citations
- An Improved Greedy Approximation for (Metric) k-MeansAuthor 5 of 6FOCS 2025 · 2 citations
- Inapproximability of Finding Sparse Vectors in Codes, Subspaces, and LatticesAuthor 3 of 4FOCS 2025 · 1 citation
- Asymptotically Optimal Hardness for k-Set Packing and k-Matroid IntersectionAuthor 1 of 3STOC 2025
- Solving the Correlation Cluster LP in Sublinear TimeAuthor 3 of 12STOC 2025
- Learning-Augmented Approximation Algorithms for Maximum Cut and Related ProblemsAuthor 4 of 5NeurIPS 2024 · 14 citations
- Understanding the Cluster Linear Program for Correlation ClusteringAuthor 3 of 6STOC 2024 · 8 citations
- Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-MedianAuthor 3 of 4SODA 2023 · 16 citations
- Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation ClusteringAuthor 2 of 4FOCS 2023 · 7 citations
- On Lifting Integrality Gaps to SSEH Hardness for Globally Constrained CSPsAuthor 2 of 2FOCS 2023 · 1 citation
- Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in ℓp-metricsAuthor 2 of 2SODA 2022 · 8 citations
- A characterization of approximability for biased CSPsAuthor 2 of 2STOC 2022 · 4 citations
- On Approximability of Clustering Problems Without Candidate CentersAuthor 2 of 2SODA 2021 · 24 citations
