Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Antares Chen"'
Publikováno v:
Random Structures & Algorithms. 58:68-93
We consider positive covering integer programs, which generalize set cover and which have attracted a long line of research developing (randomized) approximation algorithms. Srinivasan (2006) gave a rounding algorithm based on the FKG inequality for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1b4c895e50ba61b18eebb83f4494dd4c
https://doi.org/10.1002/rsa.20964
https://doi.org/10.1002/rsa.20964
Publikováno v:
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
We prove that a random $d$-regular graph, with high probability, is a cut sparsifier of the clique with approximation error at most $\left(2\sqrt{\frac 2 \pi} + o_{n,d}(1)\right)/\sqrt d$, where $2\sqrt{\frac 2 \pi} = 1.595\ldots$ and $o_{n,d}(1)$ de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::89710457539546c2569b917e0692eab5
http://arxiv.org/abs/2008.05648
http://arxiv.org/abs/2008.05648
Publikováno v:
L@S
Teaching students to write code with good style is important but difficult: in-depth feedback currently requires a human. AutoStyle, a style tutor that scales, offers adaptive, real-time holistic style feedback and hints as students improve their cod
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::53ec77ed05ee724ec2b3c60804c97090
https://doi.org/10.1145/3051457.3051469
https://doi.org/10.1145/3051457.3051469