( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Faster Algorithms for Rooted Connectivity in Directed Graphs.

, и . ICALP, том 198 из LIPIcs, стр. 49:1-49:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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.

Siegfried Kent

Kent Kwee

Kent Curtis

Kent Rottschäfer

Kent Otto

 

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

Fast Approximations for Metric-TSP via Linear Programming., и . CoRR, (2018)Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs., и . SIAM J. Comput., 46 (6): 1712-1744 (2017)On Approximating (Sparse) Covering Integer Programs., и . SODA, стр. 1596-1615. SIAM, (2019)Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems., , и . APPROX-RANDOM, том 207 из LIPIcs, стр. 24:1-24:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Fast and Deterministic Approximations for k-Cut.. APPROX-RANDOM, том 145 из LIPIcs, стр. 23:1-23:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Parallelizing greedy for submodular set function maximization in matroids and beyond., и . CoRR, (2018)_1 -sparsity Approximation Bounds for Packing Integer Programs., , и . IPCO, том 11480 из Lecture Notes in Computer Science, стр. 128-140. Springer, (2019)Spectral Sparsification of Metrics and Kernels.. SODA, стр. 1445-1464. SIAM, (2021)Densest Subgraph: Supermodularity, Iterative Peeling, and Flow., , и . SODA, стр. 1531-1555. SIAM, (2022)Nearly linear time approximations for mixed packing and covering problems without data structures or randomization.. SOSA, стр. 69-80. SIAM, (2020)