ACM Transactions on Algorithms - researchr journal

researchr

You are not signed in
Sign in
Sign up

Yann Disser, Martin Skutella. The Simplex Algorithm Is NP-Mighty. ACM Transactions on Algorithms, 15(1), 2019.
Sergio Cabello. Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs. ACM Transactions on Algorithms, 15(2), 2019.
Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk 0001. On Problems Equivalent to (min, +)-Convolution. ACM Transactions on Algorithms, 15(1), 2019.
Zbigniew Golebiewski, Abram Magner, Wojciech Szpankowski. Entropy and Optimal Compression of Some General Plane Trees. ACM Transactions on Algorithms, 15(1), 2019.
David Adjiashvili. Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs. ACM Transactions on Algorithms, 15(2), 2019.
Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski. Improved Analysis of Deterministic Load-Balancing Schemes. ACM Transactions on Algorithms, 15(1), 2019.
Ami Paz, Gregory Schwartzman. A (2+&epsi;)-Approximation for Maximum Weight Matching in the Semi-streaming Model. ACM Transactions on Algorithms, 15(2), 2019.
Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour. Approximation Schemes for Clustering with Outliers. ACM Transactions on Algorithms, 15(2), 2019.
Nikhil Bansal, Marek Eliés, Lukasz Jez, Grigorios Koumoutsos. h, k)-Server Problem on Bounded Depth Trees. ACM Transactions on Algorithms, 15(2), 2019.
Hiroshi Hirai. A Dual Descent Algorithm for Node-capacitated Multiflow Problems and Its Applications. ACM Transactions on Algorithms, 15(1), 2019.