The following pages link to Euiwoong Lee (Q315528):
Displayed 49 items.
- Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
- APX-hardness of maximizing Nash social welfare with indivisible items (Q1675918) (← links)
- Strong inapproximability results on balanced rainbow-colorable hypergraphs (Q1715058) (← links)
- Matroid-based TSP rounding for half-integral solutions (Q2164710) (← links)
- Partitioning a graph into small pieces with applications to path transversal (Q2316611) (← links)
- Beating the 2-approximation factor for global bicut (Q2316621) (← links)
- Minimum Birkhoff-von Neumann decomposition (Q2401174) (← links)
- Maximum matching in the online batch-arrival model (Q2401175) (← links)
- On some variants of Euclidean \(k\)-supplier (Q2670484) (← links)
- Strong hardness of approximation for tree transversals (Q2681395) (← links)
- (Q2816412) (← links)
- Hardness of Graph Pricing Through Generalized Max-Dicut (Q2941530) (← links)
- Complexity of approximating CSP with balance / hard constraints (Q2988897) (← links)
- Nearly Optimal NP-Hardness of Unique Coverage (Q4575703) (← links)
- Partitioning a Graph into Small Pieces with Applications to Path Transversal (Q4575844) (← links)
- (Q4608074) (← links)
- Global and fixed-terminal cuts in digraphs (Q5002602) (← links)
- (Q5002634) (← links)
- (Q5009622) (← links)
- Optimal Bounds for the <i>k</i> -cut Problem (Q5066939) (← links)
- (Q5091192) (← links)
- (Q5111424) (← links)
- (Q5136324) (← links)
- The Karger-Stein algorithm is optimal for k-cut (Q5144935) (← links)
- The number of minimum <i>k</i> -cuts: improving the Karger-Stein bound (Q5212764) (← links)
- A PTAS for <i>ℓ<sub>p</sub></i>-Low Rank Approximation (Q5236230) (← links)
- Approximability of <i>p</i> → <i>q</i> Matrix Norms: Generalized Krivine Rounding and Hypercontractive Hardness (Q5236267) (← links)
- Losing Treewidth by Separating Subsets (Q5236288) (← links)
- Nearly Optimal NP-Hardness of Unique Coverage (Q5269824) (← links)
- Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
- (Q5351896) (← links)
- (Q5351907) (← links)
- (Q5351908) (← links)
- LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes (Q5363049) (← links)
- Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs (Q5363095) (← links)
- (Q5368904) (← links)
- LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes (Q5375586) (← links)
- Clustering Affine Subspaces: Hardness and Algorithms (Q5741766) (← links)
- (Q5875460) (← links)
- Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms (Q5885598) (← links)
- Maximum Matching in the Online Batch-arrival Model (Q5888940) (← links)
- (Q6065472) (← links)
- A characterization of approximability for biased CSPs (Q6083553) (← links)
- A framework for quadratic form maximization over convex sets through nonconvex relaxations (Q6087051) (← links)
- (Q6090877) (← links)
- (Q6126248) (← links)
- (Q6147253) (← links)
- (Q6147414) (← links)
- Approximating Operator Norms via Generalized Krivine Rounding (Q6300185) (← links)