D S ] 3 M ar 2 01 6 Tight Hardness Results for Maximum Weight Rectangles
2018 1 citations17 references
Looking for the full paper…
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
Abstract
No abstract is available from our sources. Use “Read paper” to view it.
TL;DRThis paper provides conditional lower bounds for the special case when points are arranged in a grid (a well studied problem known as M AXIMUM SUBARRAY problem) as well as for other related problems, based on assumptions that the best own algorithms for the ALL -PAIRS SHORTEST PATHS problem (APSP) and for the M AX -WEIGHT k-CLIQUE problem in edge-weighted graphs are essentially optimal. (Semantic Scholar)