Truly Subcubic Min-Plus Product for Less Structured Matrices, with Applications

The goal of this paper is to get truly subcubic algorithms for Min-Plus product for less structured inputs than what was previously known, and to apply them to versions of All-Pairs Shortest Paths (APSP) and other problems. The results are as follows: (1) Our main result is the first truly subcubic algorithm for the Min-Plus product of two n× n matrices A and B with polylog(n) bit integer entries, where B has a partitioning into n^ϵ× n^ϵ blocks (for any ϵ>0) where each block is at most n^δ-far (for δ<3-ω, where 2≤ω<2.373) in ℓ_∞ norm from a constant rank integer matrix. This result presents the most general case to date of Min-Plus product that is solvable in truly subcubic time. (2) The first application of our main result is a truly subcubic algorithm for APSP in a new type of geometric graph. Our result extends the result of Chan'10 in the case of integer edge weights by allowing the weights to differ from a function of the end-point identities by at most n^δ for small δ. (3) In the second application we consider a batch version of the range mode problem in which one is given a length n sequence and n contiguous subsequences, and one is asked to compute the range mode of each subsequence. We give the first O(n^1.5-ϵ) time for ϵ>0 algorithm for this batch range mode problem. (4) Our final application is to the Maximum Subarray problem: given an n× n integer matrix, find the contiguous subarray of maximum entry sum. We show that Maximum Subarray can be solved in truly subcubic, O(n^3-ϵ) (for ϵ>0) time, as long as the entries are no larger than O(n^0.62) in absolute value. We also improve all the known conditional hardness results for the d-dimensional variant of Maximum Subarray.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/06/2021

Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths

One of the most basic graph problems, All-Pairs Shortest Paths (APSP) is...
research
11/14/2019

{-1,0,1}-APSP and (min,max)-Product Problems

In the {-1,0,1}-APSP problem the goal is to compute all-pairs shortest p...
research
04/24/2018

Principally Box-integer Polyhedra and Equimodular Matrices

A polyhedron is box-integer if its intersection with any integer box {ℓ≤...
research
02/11/2021

Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths

APSP with small integer weights in undirected graphs [Seidel'95, Galil a...
research
04/22/2020

A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2 × 2 submatrices

In this paper, we consider the problem of computing the rank of a block-...
research
10/17/2021

Faster Algorithms for Bounded-Difference Min-Plus Product

Min-plus product of two n× n matrices is a fundamental problem in algori...
research
08/04/2022

Improved Bounds for Rectangular Monotone Min-Plus Product

In a recent breakthrough paper, Chi et al. (STOC'22) introduce an Õ(n^3 ...

Please sign up or login with your details

Forgot password? Click here to reset