My Photo

Euiwoong Lee

Contact

Address:
7503 Gates Hillman Center
Computer Science Department
Carnegie Mellon University

Email: euiwoonl at cs dot cmu dot edu


I am a PhD student at the Computer Science Department at Carnegie Mellon University. I am fortunate to be advised by Venkatesan Guruswami. I am supported by Samsung Scholarship and Simons Award for Graduate Students in TCS.


Interests and Current Research
Approximation Algorithms
Hardness of Approximation
Convex Hierarchies (e.g., Sum of Squares, Sherali-Adams)


Publications
Weak Decoupling, Polynomial Folds, and Approximate Optimization over the Sphere (ECCC)
with Vijay Bhattiprolu and Mrinalkanti Ghosh and Venkatesan Guruswami and Madhur Tulsiani
Submitted


Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere (arXiv)
with Vijay Bhattiprolu and Venkatesan Guruswami
RANDOM '17

Global and Fixed-terminal Cuts in Digraphs (arXiv)
with Kristóf Bérczi and Karthekeyan Chandrasekaran and Tamás Király and Chao Xu
APPROX '17

Why You Should Charge Your Friends for Borrowing Your Stuff
with Kijung Shin and Dhivya Eswaran and Ariel Procaccia
IJCAI '17
Featured in New Scientist

Improved Hardness for Cut, Interdiction, and Firefighter Problems (arXiv)
ICALP '17
Best Student Paper

APX-Hardness of Maximizing Nash Social Welfare with Indivisible Items (arXiv) (IPL)
Information Processing Letters (IPL) '17

Improved and Simplified Inapproximability for k-means (arXiv) (IPL)
with Melanie Schmidt and John Wright
Information Processing Letters (IPL) '17

Minimum Birkhoff-von Neumann Decomposition (PDF)
with Janardhan Kulkarni and Mohit Singh
IPCO '17

Maximum Matching in the Online Batch-Arrival Model (PDF)
with Sahil Singla
IPCO '17

Partitioning a Graph into Small Pieces with Applications to Path Transversal (arXiv)
SODA '17


Simple Proof of Hardness of Feedback Vertex Set (TOC)
with Venkatesan Guruswami
Theory of Computing (TOC) '16 (Note)

Nearly Optimal NP-hardness of Unique Coverage (ECCC)
with Venkatesan Guruswami
SODA '16
Journal version: To appear in SIAM Journal on Computing (SICOMP)


Approximate Hypergraph Coloring under Low-discrepancy and Related Promises (arXiv)
with Vijay Bhattiprolu and Venkatesan Guruswami
APPROX '15

Towards a Characterization of Approximation Resistance for Symmetric CSPs (ECCC)
with Venkatesan Guruswami
APPROX '15
Journal version: To appear in Theory of Computing (Invited)

Inapproximability of H-Transversal/Packing (arXiv)
with Venkatesan Guruswami
APPROX '15
Journal version: To appear in SIAM Journal on Discrete Mathematics (SIDMA)
Earlier version: Inapproximability of Feedback Vertex Set for Bounded Length Cycles (ECCC)

Hardness of Graph Pricing Through Generalized Max-Dicut (arXiv)
STOC '15

Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs (ECCC)
with Venkatesan Guruswami
SODA '15
Journal version: To appear in Combinatorica

LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes (arXiv)
with Badih Ghazi
SODA '15
Journal version: IEEE Transactions on Information Theory (IEEE)


Complexity of Approximating CSP with Balance/Hard Constraints (ECCC) (TOCS)
with Venkatesan Guruswami
ITCS '14
Journal version: Theory of Computing Systems (TOCS) '16


Improved Bounds on the Price of Stability in Network Cost Sharing Games (PDF)
with Katrina Ligett
EC '13

Clustering Affine Subspaces: Hardness and Algorithms (PDF)
with Leonard Schulman
SODA '13


Progress on Pricing with Peering (PDF)
with David Buchfuhrer, Lachlan Andrew, Ao Tang, and Steven Low
CISS '08

Pricing in the Presence of Peering (PDF)
with David Buchfuhrer, Lachlan Andrew, Ao Tang, and Steven Low
Allerton '07

Here is my CV.