default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEuiwoong Lee
Person information
- affiliation: University of Michigan, USA
- affiliation (former): Carnegie Mellon University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j20]Anupam Gupta, Euiwoong Lee
, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar:
Matroid-based TSP rounding for half-integral solutions. Math. Program. 206(1): 541-576 (2024)- [c54]Euiwoong Lee, Pasin Manurangsi:
Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs. ITCS 2024: 71:1-71:17 - [c53]Aditya Anand, Euiwoong Lee:
Separating k -sc Median from the Supplier Version. IPCO 2024: 14-27 - [c52]Vincent Cohen-Addad, Chenglin Fan, Suprovat Ghoshal, Euiwoong Lee, Arnaud de Mesmay, Alantha Newman, Tony Chang Wang:
A PTAS for ℓ0-Low Rank Approximation: Solving Dense CSPs over Reals. SODA 2024: 935-961 - [c51]Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak:
Approximating Small Sparse Cuts. STOC 2024: 319-330 - [c50]Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman, Lukas Vogl:
Understanding the Cluster Linear Program for Correlation Clustering. STOC 2024: 1605-1616 - [i65]Aditya Anand, Euiwoong Lee:
Separating k-Median from the Supplier Version. CoRR abs/2401.13819 (2024) - [i64]Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Euiwoong Lee, Debmalya Panigrahi:
Max-Cut with ε-Accurate Predictions. CoRR abs/2402.18263 (2024) - [i63]Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak:
Approximating Small Sparse Cuts. CoRR abs/2403.08983 (2024) - [i62]Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman, Lukas Vogl:
Understanding the Cluster LP for Correlation Clustering. CoRR abs/2404.17509 (2024) - [i61]Karthik C. S., Euiwoong Lee, Pasin Manurangsi:
On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP. CoRR abs/2407.08917 (2024) - [i60]Aditya Anand, Euiwoong Lee, Jason Li, Yaowei Long, Thatchaphol Saranurak:
Unbreakable Decomposition in Close-to-Linear Time. CoRR abs/2408.09368 (2024) - [i59]Hadley Black, Euiwoong Lee, Arya Mazumdar, Barna Saha:
Clustering with Non-adaptive Subset Queries. CoRR abs/2409.10908 (2024) - [i58]Vijay Bhattiprolu, Euiwoong Lee:
Inapproximability of Sparsest Vector in a Real Subspace. CoRR abs/2410.02636 (2024) - [i57]Vijay Bhattiprolu, Euiwoong Lee:
Inapproximability of Sparsest Vector in a Real Subspace. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j19]Euiwoong Lee, Pengxiang Wang:
Strong hardness of approximation for tree transversals. Inf. Process. Lett. 181: 106352 (2023) - [j18]Vijay Bhattiprolu, Mrinal Kanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani:
Inapproximability of Matrix p → q Norms. SIAM J. Comput. 52(1): 132-155 (2023) - [c49]Suprovat Ghoshal, Euiwoong Lee:
On Lifting Integrality Gaps to SSEH Hardness for Globally Constrained CSPs. FOCS 2023: 26-36 - [c48]Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman:
Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering. FOCS 2023: 1082-1104 - [c47]Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee, Chris Schwiegelshohn:
Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median. SODA 2023: 940-986 - [c46]Anupam Gupta, Euiwoong Lee, Jason Li:
A Local Search-Based Approach for Set Covering. SOSA 2023: 1-11 - [c45]Amir Abboud, Vincent Cohen-Addad, Euiwoong Lee, Pasin Manurangsi:
On the Fine-Grained Complexity of Approximating k-Center in Sparse Graphs. SOSA 2023: 145-155 - [i56]Suprovat Ghoshal, Euiwoong Lee:
On Lifting Integrality Gaps to SSEH Hardness for Globally Constrained CSPs. CoRR abs/2308.09667 (2023) - [i55]Euiwoong Lee, Pasin Manurangsi:
Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs. CoRR abs/2309.04099 (2023) - [i54]Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman:
Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering. CoRR abs/2309.17243 (2023) - [i53]Vincent Cohen-Addad, Chenglin Fan, Suprovat Ghoshal, Euiwoong Lee, Arnaud de Mesmay, Alantha Newman, Tony Chang Wang:
A PTAS for 𝓁0-Low Rank Approximation: Solving Dense CSPs over Reals. CoRR abs/2311.00892 (2023) - 2022
- [j17]Jungho Ahn, Eun Jung Kim, Euiwoong Lee:
Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion. Algorithmica 84(7): 2106-2133 (2022) - [j16]Anupam Gupta, David G. Harris, Euiwoong Lee, Jason Li:
Optimal Bounds for the k-cut Problem. J. ACM 69(1): 2:1-2:18 (2022) - [j15]Euiwoong Lee, Viswanath Nagarajan, Lily Wang:
On some variants of Euclidean k-supplier. Oper. Res. Lett. 50(2): 115-121 (2022) - [c44]Vincent Cohen-Addad, Chenglin Fan, Euiwoong Lee, Arnaud de Mesmay:
Fitting Metrics and Ultrametrics with Minimum Disagreements. FOCS 2022: 301-311 - [c43]Vincent Cohen-Addad, Euiwoong Lee, Alantha Newman:
Correlation Clustering with Sherali-Adams. FOCS 2022: 651-661 - [c42]Amir Abboud, Vincent Cohen-Addad, Euiwoong Lee, Pasin Manurangsi:
Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems. ICALP 2022: 7:1-7:18 - [c41]Vijay Bhattiprolu, Euiwoong Lee, Madhur Tulsiani:
Separating the NP-Hardness of the Grothendieck Problem from the Little-Grothendieck Problem. ITCS 2022: 22:1-22:17 - [c40]Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar:
Matroid-Based TSP Rounding for Half-Integral Solutions. IPCO 2022: 305-318 - [c39]Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee:
Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in ℓp-metrics. SODA 2022: 1493-1530 - [c38]Euiwoong Lee, Suprovat Ghoshal:
A characterization of approximability for biased CSPs. STOC 2022: 989-997 - [i52]Suprovat Ghoshal, Euiwoong Lee:
A Characterization of Approximability for Biased CSPs. CoRR abs/2201.04617 (2022) - [i51]Amir Abboud, Vincent Cohen-Addad, Euiwoong Lee, Pasin Manurangsi:
Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems. CoRR abs/2203.01857 (2022) - [i50]Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee, Chris Schwiegelshohn:
Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median. CoRR abs/2207.05150 (2022) - [i49]Vincent Cohen-Addad, Euiwoong Lee, Alantha Newman:
Correlation Clustering with Sherali-Adams. CoRR abs/2207.10889 (2022) - [i48]Vincent Cohen-Addad, Chenglin Fan, Euiwoong Lee, Arnaud de Mesmay:
Fitting Metrics and Ultrametrics with Minimum Disagreements. CoRR abs/2208.13920 (2022) - [i47]Anupam Gupta, Euiwoong Lee, Jason Li:
A Local Search-Based Approach for Set Covering. CoRR abs/2211.04444 (2022) - 2021
- [j14]Kijung Shin, Euiwoong Lee, Jinoh Oh, Mohammad Hammoud, Christos Faloutsos:
CoCoS: Fast and Accurate Distributed Triangle Counting in Graph Streams. ACM Trans. Knowl. Discov. Data 15(3): 38:1-38:30 (2021) - [c37]Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos:
A Constant-Factor Approximation for Weighted Bond Cover. APPROX-RANDOM 2021: 7:1-7:14 - [c36]Anupam Gupta, Euiwoong Lee, Jason Li:
The Connectivity Threshold for Dense Graphs. SODA 2021: 89-105 - [c35]Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee:
On Approximability of Clustering Problems Without Candidate Centers. SODA 2021: 2635-2648 - [c34]Vijay Bhattiprolu, Euiwoong Lee, Assaf Naor:
A framework for quadratic form maximization over convex sets through nonconvex relaxations. STOC 2021: 870-881 - [i46]Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos:
A Constant-factor Approximation for Weighted Bond Cover. CoRR abs/2105.00857 (2021) - [i45]Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar:
Matroid-Based TSP Rounding for Half-Integral Solutions. CoRR abs/2111.09290 (2021) - [i44]Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee:
Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in L_p metrics. CoRR abs/2111.10912 (2021) - [i43]Euiwoong Lee, Viswanath Nagarajan, Lily Wang:
On Some Variants of Euclidean K-Supplier. CoRR abs/2112.01700 (2021) - [i42]Euiwoong Lee, Pengxiang Wang:
Strong Hardness of Approximation for Tree Transversals. CoRR abs/2112.01710 (2021) - [i41]Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee:
Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in $\ell_p$-metrics. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j13]Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee, Pasin Manurangsi:
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms. Algorithms 13(6): 146 (2020) - [j12]Euiwoong Lee, Sahil Singla:
Maximum Matching in the Online Batch-arrival Model. ACM Trans. Algorithms 16(4): 49:1-49:31 (2020) - [c33]Vaggos Chatziafratis, Grigory Yaroslavtsev, Euiwoong Lee, Konstantin Makarychev, Sara Ahmadian, Alessandro Epasto, Mohammad Mahdian:
Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection. AISTATS 2020: 3121-3132 - [c32]Jungho Ahn, Eun Jung Kim, Euiwoong Lee:
Towards Constant-Factor Approximation for Chordal / Distance-Hereditary Vertex Deletion. ISAAC 2020: 62:1-62:16 - [c31]Anupam Gupta, Euiwoong Lee, Jason Li:
The Karger-Stein algorithm is optimal for k-cut. STOC 2020: 473-484 - [i40]Anupam Gupta, David G. Harris, Euiwoong Lee, Jason Li:
Optimal Bounds for the k-cut Problem. CoRR abs/2005.08301 (2020) - [i39]Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee, Pasin Manurangsi:
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms. CoRR abs/2006.04411 (2020) - [i38]Jungho Ahn, Eun Jung Kim, Euiwoong Lee:
Towards constant-factor approximation for chordal / distance-hereditary vertex deletion. CoRR abs/2009.00809 (2020) - [i37]Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee:
On Approximability of Clustering Problems Without Candidate Centers. CoRR abs/2010.00087 (2020) - [i36]Vaggos Chatziafratis, Neha Gupta, Euiwoong Lee:
Inapproximability for Local Correlation Clustering and Dissimilarity Hierarchical Clustering. CoRR abs/2010.01459 (2020) - [i35]Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee, Pasin Manurangsi:
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j11]Euiwoong Lee:
Partitioning a graph into small pieces with applications to path transversal. Math. Program. 177(1-2): 1-19 (2019) - [j10]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu:
Beating the 2-approximation factor for global bicut. Math. Program. 177(1-2): 291-320 (2019) - [c30]Prahladh Harsha, Subhash Khot, Euiwoong Lee, Devanathan Thiruvenkatachari:
Improved 3LIN Hardness via Linear Label Cover. APPROX-RANDOM 2019: 9:1-9:16 - [c29]Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, Jason Li:
Tight FPT Approximations for k-Median and k-Means. ICALP 2019: 42:1-42:14 - [c28]Frank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, David P. Woodruff:
A PTAS for ℓp-Low Rank Approximation. SODA 2019: 747-766 - [c27]Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani:
Approximability of p → q Matrix Norms: Generalized Krivine Rounding and Hypercontractive Hardness. SODA 2019: 1358-1368 - [c26]Anupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michal Wlodarczyk:
Losing Treewidth by Separating Subsets. SODA 2019: 1731-1749 - [c25]Anupam Gupta, Euiwoong Lee, Jason Li:
The number of minimum k-cuts: improving the Karger-Stein bound. STOC 2019: 229-240 - [i34]Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, Jason Li:
Tight FPT Approximations for $k$-Median and k-Means. CoRR abs/1904.12334 (2019) - [i33]Anupam Gupta, Euiwoong Lee, Jason Li:
The Number of Minimum k-Cuts: Improving the Karger-Stein Bound. CoRR abs/1906.00417 (2019) - [i32]Anupam Gupta, Euiwoong Lee, Jason Li:
The Karger-Stein Algorithm is Optimal for k-cut. CoRR abs/1911.09165 (2019) - [i31]Sara Ahmadian, Vaggos Chatziafratis, Alessandro Epasto, Euiwoong Lee, Mohammad Mahdian, Konstantin Makarychev, Grigory Yaroslavtsev:
Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection. CoRR abs/1912.06983 (2019) - [i30]Prahladh Harsha, Subhash Khot, Euiwoong Lee, Devanathan Thiruvenkatachari:
Improved 3LIN Hardness via Linear Label Cover. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j9]Venkatesan Guruswami, Euiwoong Lee:
Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs. Comb. 38(3): 547-599 (2018) - [j8]Badih Ghazi, Euiwoong Lee:
LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes. IEEE Trans. Inf. Theory 64(6): 4423-4437 (2018) - [c24]Euiwoong Lee, Sahil Singla:
Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities. ESA 2018: 57:1-57:14 - [c23]Anupam Gupta, Euiwoong Lee, Jason Li:
Faster Exact and Approximate Algorithms for k-Cut. FOCS 2018: 113-123 - [c22]Kijung Shin, Mohammad Hammoud, Euiwoong Lee, Jinoh Oh, Christos Faloutsos:
Tri-Fly: Distributed Estimation of Global and Local Triangle Counts in Graph Streams. PAKDD (3) 2018: 651-663 - [c21]Anupam Gupta, Euiwoong Lee, Jason Li:
An FPT Algorithm Beating 2-Approximation for k-Cut. SODA 2018: 2821-2837 - [i29]Kijung Shin, Euiwoong Lee, Jinoh Oh, Mohammad Hammoud, Christos Faloutsos:
DiSLR: Distributed Sampling with Limited Redundancy For Triangle Counting in Graph Streams. CoRR abs/1802.04249 (2018) - [i28]Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani:
Inapproximability of Matrix p→q Norms. CoRR abs/1802.07425 (2018) - [i27]Anupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michal Wlodarczyk:
Losing Treewidth by Separating Subsets. CoRR abs/1804.01366 (2018) - [i26]Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani:
Approximating Operator Norms via Generalized Krivine Rounding. CoRR abs/1804.03644 (2018) - [i25]Euiwoong Lee, Sahil Singla:
Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities. CoRR abs/1806.09251 (2018) - [i24]Frank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, David P. Woodruff:
A PTAS for 𝓁p-Low Rank Approximation. CoRR abs/1807.06101 (2018) - [i23]Anupam Gupta, Euiwoong Lee, Jason Li:
Faster Exact and Approximate Algorithms for k-Cut. CoRR abs/1807.08144 (2018) - [i22]Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani:
Inapproximability of Matrix p→q Norms. Electron. Colloquium Comput. Complex. TR18 (2018) - [i21]Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani:
Approximating Operator Norms via Generalized Krivine Rounding. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j7]Euiwoong Lee, Melanie Schmidt, John Wright:
Improved and simplified inapproximability for k-means. Inf. Process. Lett. 120: 40-43 (2017) - [j6]Euiwoong Lee:
APX-hardness of maximizing Nash social welfare with indivisible items. Inf. Process. Lett. 122: 17-20 (2017) - [j5]Venkatesan Guruswami, Euiwoong Lee:
Nearly Optimal NP-Hardness of Unique Coverage. SIAM J. Comput. 46(3): 1018-1028 (2017) - [j4]Venkatesan Guruswami, Euiwoong Lee:
Inapproximability of H-Transversal/Packing. SIAM J. Discret. Math. 31(3): 1552-1571 (2017) - [j3]Venkatesan Guruswami, Euiwoong Lee:
Towards a Characterization of Approximation Resistance for Symmetric CSPs. Theory Comput. 13(1): 1-24 (2017) - [c20]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu:
Global and Fixed-Terminal Cuts in Digraphs. APPROX-RANDOM 2017: 2:1-2:20 - [c19]Vijay Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee:
Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere. APPROX-RANDOM 2017: 31:1-31:20 - [c18]Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani:
Weak Decoupling, Polynomial Folds and Approximate Optimization over the Sphere. FOCS 2017: 1008-1019 - [c17]Guru Guruganesh, Euiwoong Lee:
Understanding the Correlation Gap For Matchings. FSTTCS 2017: 32:1-32:15 - [c16]Euiwoong Lee:
Improved Hardness for Cut, Interdiction, and Firefighter Problems. ICALP 2017: 92:1-92:14 - [c15]Kijung Shin, Euiwoong Lee, Dhivya Eswaran, Ariel D. Procaccia:
Why You Should Charge Your Friends for Borrowing Your Stuff. IJCAI 2017: 395-401 - [c14]Janardhan Kulkarni, Euiwoong Lee, Mohit Singh:
Minimum Birkhoff-von Neumann Decomposition. IPCO 2017: 343-354 - [c13]Euiwoong Lee, Sahil Singla:
Maximum Matching in the Online Batch-Arrival Model. IPCO 2017: 355-367 - [c12]Euiwoong Lee:
Partitioning a Graph into Small Pieces with Applications to Path Transversal. SODA 2017: 1546-1558 - [i20]Kijung Shin, Euiwoong Lee, Dhivya Eswaran, Ariel D. Procaccia:
Why You Should Charge Your Friends for Borrowing Your Stuff. CoRR abs/1705.07343 (2017) - [i19]Guru Guruganesh, Euiwoong Lee:
Understanding the Correlation Gap for Matchings. CoRR abs/1710.06339 (2017) - [i18]Anupam Gupta, Euiwoong Lee, Jason Li:
An FPT Algorithm Beating 2-Approximation for k-Cut. CoRR abs/1710.08488 (2017) - 2016
- [j2]Venkatesan Guruswami, Euiwoong Lee:
Complexity of Approximating CSP with Balance / Hard Constraints. Theory Comput. Syst. 59(1): 76-98 (2016) - [j1]Venkatesan Guruswami, Euiwoong Lee:
Simple Proof of Hardness of Feedback Vertex Set. Theory Comput. 12(1): 1-11 (2016) - [c11]Venkatesan Guruswami, Euiwoong Lee:
Nearly Optimal NP-Hardness of Unique Coverage. SODA 2016: 1724-1730 - [i17]Vijay V. S. P. Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee:
Certifying Random Polynomials over the Unit Sphere via Sum of Squares Hierarchy. CoRR abs/1605.00903 (2016) - [i16]Euiwoong Lee:
Partitioning a Graph into Small Pieces with Applications to Path Transversal. CoRR abs/1607.05122 (2016) - [i15]Euiwoong Lee:
Improved Hardness for Cut, Interdiction, and Firefighter Problems. CoRR abs/1607.05133 (2016) - [i14]Vijay V. S. P. Bhattiprolu, Mrinalkanti Ghosh, Euiwoong Lee, Venkatesan Guruswami, Madhur Tulsiani:
Multiplicative Approximations for Polynomial Optimization Over the Unit Sphere. CoRR abs/1611.05998 (2016) - [i13]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu:
Global and fixed-terminal cuts in digraphs. CoRR abs/1612.00156 (2016) - [i12]Vijay V. S. P. Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani:
Multiplicative Approximations for Polynomial Optimization Over the Unit Sphere. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c10]Vijay V. S. P. Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee:
Approximate Hypergraph Coloring under Low-discrepancy and Related Promises. APPROX-RANDOM 2015: 152-174 - [c9]Venkatesan Guruswami, Euiwoong Lee:
Inapproximability of H-Transversal/Packing. APPROX-RANDOM 2015: 284-304 - [c8]Venkatesan Guruswami, Euiwoong Lee:
Towards a Characterization of Approximation Resistance for Symmetric CSPs. APPROX-RANDOM 2015: 305-322 - [c7]Venkatesan Guruswami, Euiwoong Lee:
Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs. SODA 2015: 822-836 - [c6]Badih Ghazi, Euiwoong Lee:
LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes. SODA 2015: 1326-1342 - [c5]Euiwoong Lee:
Hardness of Graph Pricing Through Generalized Max-Dicut. STOC 2015: 391-399 - [i11]Venkatesan Guruswami, Euiwoong Lee:
Inapproximability of $H$-Transversal/Packing. CoRR abs/1506.06302 (2015) - [i10]Vijay V. S. P. Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee:
Approximate Hypergraph Coloring under Low-discrepancy and Related Promises. CoRR abs/1506.06444 (2015) - [i9]Euiwoong Lee:
APX-Hardness of Maximizing Nash Social Welfare with Indivisible Items. CoRR abs/1507.01159 (2015) - [i8]Euiwoong Lee, Melanie Schmidt, John Wright:
Improved and Simplified Inapproximability for k-means. CoRR abs/1509.00916 (2015) - [i7]Venkatesan Guruswami, Euiwoong Lee:
Towards a Characterization of Approximation Resistance for Symmetric CSPs. Electron. Colloquium Comput. Complex. TR15 (2015) - [i6]Venkatesan Guruswami, Euiwoong Lee:
Nearly Optimal NP-Hardness of Unique Coverage. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c4]Venkatesan Guruswami, Euiwoong Lee:
Complexity of approximating CSP with balance / hard constraints. ITCS 2014: 439-448 - [i5]Euiwoong Lee:
Hardness of Graph Pricing through Generalized Max-Dicut. CoRR abs/1405.0740 (2014) - [i4]Badih Ghazi, Euiwoong Lee:
LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes. CoRR abs/1410.4241 (2014) - [i3]Venkatesan Guruswami, Euiwoong Lee:
Inapproximability of Feedback Vertex Set for Bounded Length Cycles. Electron. Colloquium Comput. Complex. TR14 (2014) - [i2]Venkatesan Guruswami, Euiwoong Lee:
Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c3]Euiwoong Lee, Katrina Ligett:
Improved bounds on the price of stability in network cost sharing games. EC 2013: 607-620 - [c2]Euiwoong Lee, Leonard J. Schulman:
Clustering Affine Subspaces: Hardness and Algorithms. SODA 2013: 810-827 - [i1]Venkatesan Guruswami, Euiwoong Lee:
Complexity of approximating CSP with Balance / Hard Constraints. Electron. Colloquium Comput. Complex. TR13 (2013)
2000 – 2009
- 2008
- [c1]Euiwoong Lee, David Buchfuhrer, Lachlan L. H. Andrew, Ao Tang, Steven H. Low:
Progress on pricing with peering. CISS 2008: 286-291
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
