( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP.

, , и . FOCS, стр. 832-843. IEEE, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Parviz Shayan

Shayan Assadi

 

Другие публикации лиц с тем же именем

A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs., и . APPROX-RANDOM, том 8096 из Lecture Notes in Computer Science, стр. 303-316. Springer, (2013)Time-Space Tradeoffs for Learning from Small Test Spaces: Learning Low Degree Polynomial Functions., , и . CoRR, (2017)A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP., , и . CoRR, (2021)An Improved Trickle-Down Theorem for Partite Complexes., и . CoRR, (2022)Online Stochastic Matching: Online Actions Based on Offline Statistics., , и . SODA, стр. 1285-1294. SIAM, (2011)Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model., , и . FOCS, стр. 1319-1330. IEEE, (2020)Monte Carlo Markov Chain Algorithms for Sampling Strongly Rayleigh Distributions and Determinantal Point Processes., , и . COLT, том 49 из JMLR Workshop and Conference Proceedings, стр. 103-115. JMLR.org, (2016)Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSP., и . FOCS, стр. 20-39. IEEE Computer Society, (2015)An Improved Trickle down Theorem for Partite Complexes., и . CCC, том 264 из LIPIcs, стр. 10:1-10:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forests., , , , и . STOC, стр. 408-420. ACM, (2021)