I agree that this site is using cookies. You can find further informations here.
X
Lee, Euiwoong
122  results:
Search for persons X
?
1

Separating $$k\text {-}\textsc {Median}$$ from the Supplier..:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Anand, Aditya ; Lee, Euiwoong - p. 14-27 , 2024
Link: https://doi.org/10.1007/..
 
?
2

Understanding the Cluster Linear Program for Correlation Cl..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Cao, Nairen ; Cohen-Addad, Vincent ; Lee, Euiwoong... - p. 1605-1616 , 2024
Link: https://dl.acm.org/doi/1..
 
?
3

Matroid-based TSP rounding for half-integral solutions:

Gupta, Anupam ; Lee, Euiwoong ; Li, Jason...
Mathematical Programming.  , 2024
Link: https://doi.org/10.1007/..
 
?
4

Approximating Small Sparse Cuts:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Anand, Aditya ; Lee, Euiwoong ; Li, Jason. - p. 319-330 , 2024
Link: https://dl.acm.org/doi/1..
 
?
5

Strong hardness of approximation for tree transversals:

Lee, Euiwoong ; Wang, Pengxiang
Information Processing Letters.  181 (2023)  - p. 106352 , 2023
Link: https://doi.org/10.1016/..
 
?
6

Handling Correlated Rounding Error via Preclustering: A 1.7..:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),
Cohen-Addad, Vincent ; Lee, Euiwoong ; Li, Shi. - p. 1082-1104 , 2023
Link: https://doi.org/10.1109/..
 
?
7

On Lifting Integrality Gaps to SSEH Hardness for Globally C..:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),
Ghoshal, Suprovat ; Lee, Euiwoong - p. 26-36 , 2023
Link: https://doi.org/10.1109/..
 
?
8

Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\..:

Bhattiprolu, Vijay ; Ghosh, Mrinal Kanti ; Guruswami, Venkatesan..
SIAM Journal on Computing.  52 (2023)  1 - p. 132-155 , 2023
Link: https://doi.org/10.1137/..
 
?
9

On some variants of Euclidean k-supplier:

Lee, Euiwoong ; Nagarajan, Viswanath ; Wang, Lily
Operations Research Letters.  50 (2022)  2 - p. 115-121 , 2022
Link: https://doi.org/10.1016/..
 
?
10

A characterization of approximability for biased CSPs:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Lee, Euiwoong ; Ghoshal, Suprovat - p. 989-997 , 2022
Link: https://dl.acm.org/doi/1..
 
?
11

Matroid-Based TSP Rounding for Half-Integral Solutions:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Gupta, Anupam ; Lee, Euiwoong ; Li, Jason... - p. 305-318 , 2022
Link: https://doi.org/10.1007/..
 
?
12

Correlation Clustering with Sherali-Adams:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Cohen-Addad, Vincent ; Lee, Euiwoong ; Newman, Alantha - p. 651-661 , 2022
Link: https://doi.org/10.1109/..
 
?
13

Fitting Metrics and Ultrametrics with Minimum Disagreements:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Cohen-Addad, Vincent ; Fan, Chenglin ; Lee, Euiwoong. - p. 301-311 , 2022
Link: https://doi.org/10.1109/..
 
?
14

Towards Constant-Factor Approximation for Chordal/Distance-..:

Ahn, Jungho ; Kim, Eun Jung ; Lee, Euiwoong
Algorithmica.  84 (2022)  7 - p. 2106-2133 , 2022
Link: https://doi.org/10.1007/..
 
?
15

Optimal Bounds for the k-cut Problem:

Gupta, Anupam ; Harris, David G. ; Lee, Euiwoong.
ACM Journal of the ACM (JACM).  69 (2021)  1 - p. 1-18 , 2021
Link: https://dl.acm.org/doi/1..
 
1-15