Euiwoong Lee

activity

20242026

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2024

Asymptotically Optimal Hardness for $k$ -Set Packing and $k$ -Matroid Intersection

Euiwoong Lee, Ola Svensson, Theophile Thiery

For any $ε > 0$ , we prove that $k$ -Dimensional Matching is hard to approximate within a factor of $k / (12 + ε)$ for large $k$ unless $\textsf{NP} \subseteq \text…

cs.CC2024

On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP

Karthik C. S., Euiwoong Lee, Pasin Manurangsi

Parameterized Inapproximability Hypothesis (PIH) is a central question in the field of parameterized complexity. PIH asserts that given as input a 2-CSP on $k$ variables and alphab…

Asymptotically Optimal Hardness for k-Set Packing and k-Matroid Intersection

On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP

Asymptotically Optimal Hardness for $k$ -Set Packing and $k$ -Matroid Intersection