An experimental study on approximating K shortest simple paths
ESA'11 Proceedings of the 19th European conference on Algorithms
Subquadratic time approximation algorithms for the girth
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Counting and detecting small subgraphs via equations and matrix multiplication
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Improving quantum query complexity of boolean matrix multiplication using graph collision
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Span programs and quantum algorithms for st-connectivity and claw detection
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
The quantum query complexity of read-many formulas
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication
ACM Transactions on Algorithms (TALG)
ACM Transactions on Algorithms (TALG)
Exact weight subgraphs and the k-sum conjecture
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Why do simple algorithms for triangle enumeration work in the real world?
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |
We say an algorithm on n by n matrices with entries in [-M, M] (or n-node graphs with edge weights from [-M, M]) is truly sub cubic if it runs in O(n^{3-\delta} \poly(\log M)) time for some \delta 0. We define a notion of sub cubic reducibility, and show that many important problems on graphs and matrices solvable in O(n^3) time are equivalent under sub cubic reductions. Namely, the following weighted problems either all have truly sub cubic algorithms, or none of them do: - The all-pairs shortest paths problem (APSP). - Detecting if a weighted graph has a triangle of negative total edge weight. - Listing up to n^{2.99} negative triangles in an edge-weighted graph. - Finding a minimum weight cycle in a graph of non-negative edge weights. - The replacement paths problem in an edge-weighted digraph. - Finding the second shortest simple path between two nodes in an edge-weighted digraph. - Checking whether a given matrix defines a metric. - Verifying the correctness of a matrix product over the (\min, +)-semiring. Therefore, if APSP cannot be solved in n^{3-\eps} time for any \eps 0, then many other problems also need essentially cubic time. In fact we show generic equivalences between matrix products over a large class of algebraic structures used in optimization, verifying a matrix product over the same structure, and corresponding triangle detection problems over the structure. These equivalences simplify prior work on sub cubic algorithms for all-pairs path problems, since it now suffices to give appropriate sub cubic triangle detection algorithms. Other consequences of our work are new combinatorial approaches to Boolean matrix multiplication over the (OR, AND)-semiring (abbreviated as BMM). We show that practical advances in triangle detection would imply practical BMM algorithms, among other results. Building on our techniques, we give two new BMM algorithms: a derandomization of the recent combinatorial BMM algorithm of Bansal and Williams (FOCS'09), and an improved quantum algorithm for BMM.