Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Euiwoong Lee"'
Publikováno v:
Algorithms, Vol 13, Iss 6, p 146 (2020)
Parameterization and approximation are two popular ways of coping with NP-hard problems. More recently, the two have also been combined to derive many interesting results. We survey developments in the area both from the algorithmic and hardness pers
Externí odkaz:
https://doaj.org/article/a0a16c20302d47f7ad8b8fcbef00cee5
Publikováno v:
SIAM Journal on Computing. 52:132-155
Publikováno v:
Symposium on Simplicity in Algorithms (SOSA) ISBN: 9781611977585
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e22380019e993ba754a70067183dd84
https://doi.org/10.1137/1.9781611977585.ch14
https://doi.org/10.1137/1.9781611977585.ch14
Publikováno v:
Symposium on Simplicity in Algorithms (SOSA) ISBN: 9781611977585
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02f3d6005f7cc73ea807d3707708689e
https://doi.org/10.1137/1.9781611977585.ch1
https://doi.org/10.1137/1.9781611977585.ch1
Publikováno v:
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d7e58da42a160785fc2be86e192b436
https://doi.org/10.1137/1.9781611977554.ch37
https://doi.org/10.1137/1.9781611977554.ch37
Publikováno v:
Journal of the ACM. 69:1-18
In the k -cut problem, we want to find the lowest-weight set of edges whose deletion breaks a given (multi)graph into k connected components. Algorithms of Karger and Stein can solve this in roughly O ( n 2k ) time. However, lower bounds from conject
Autor:
Sahil Singla, Euiwoong Lee
Publikováno v:
ACM Transactions on Algorithms. 16:1-31
Consider a two-stage matching problem, where edges of an input graph are revealed in two stages (batches) and in each stage we have to immediately and irrevocably extend our matching using the edges from that stage. The natural greedy algorithm is ha
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783031069000
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::533f060397e0fdb37bcc1810bdb3874c
https://doi.org/10.1007/978-3-031-06901-7_23
https://doi.org/10.1007/978-3-031-06901-7_23
Given $x \in (\mathbb{R}_{\geq 0})^{\binom{[n]}{2}}$ recording pairwise distances, the METRIC VIOLATION DISTANCE (MVD) problem asks to compute the $\ell_0$ distance between $x$ and the metric cone; i.e., modify the minimum number of entries of $x$ to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bdd9e23260b797406f666fd3a9019e5b