Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter
- Amir Abboud
- Fabrizio Grandoni
- et al.
- 2023
- ACM Transactions on Algorithms
Publications
Date
Featured collections
Popular topics
25 results at ACM Transactions on Algorithms
Fully Dynamic MIS in Uniformly Sparse Graphs
- Krzysztof Onak
- Baruch Schieber
- et al.
- 2020
- ACM Transactions on Algorithms
Streaming algorithms for estimating the matching size in planar graphs and beyond
- Hossein Esfandiari
- Mohammadtaghi Hajiaghayi
- et al.
- 2018
- ACM Transactions on Algorithms
A simple and efficient algorithm for computing market equilibria
- Lisa Fleischer
- Rahul Garg
- et al.
- 2016
- ACM Transactions on Algorithms
All-or-nothing generalized assignment with application to scheduling advertising campaigns
- Ron Adany
- Moran Feldman
- et al.
- 2016
- ACM Transactions on Algorithms
Distributed algorithms for end-to-end packet scheduling in wireless ad hoc networks
- V.S. Anil Kumar
- Madhav V. Marathe
- et al.
- 2016
- ACM Transactions on Algorithms
Sorting and selection with imprecise comparisons
- Miklós Ajtai
- Vitaly Feldman
- et al.
- 2015
- ACM Transactions on Algorithms
A logarithmic approximation for unsplittable flow on line graphs
- Nikhil Bansal
- Zachary Friggstad
- et al.
- 2014
- ACM Transactions on Algorithms
Optimal bounds for Johnson-Lindenstrauss transforms and streaming problems with subconstant error
- T.S. Jayram
- David P. Woodruff
- 2013
- ACM Transactions on Algorithms
Prize-collecting steiner network problems
- Mohammadtaghi Hajiaghayi
- Rohit Khandekar
- et al.
- 2012
- ACM Transactions on Algorithms