Matrix searching with the shortest path metric

DOI10.1145/167088.167220zbMath1310.68110OpenAlexW2008574450MaRDI QIDQ5248518

J. E. Hershberger, Subhash Suri

Publication date: 7 May 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/167088.167220

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (6)

Computing the L 1-diameter and center of a simple rectilinear polygon in parallel ⋮ Finding a closet visible vertex pair between two polygons ⋮ A maximum \(b\)-matching problem arising from median location models with applications to the roommates problem ⋮ On geometric path query problems ⋮ Consecutive interval query and dynamic programming on intervals ⋮ Finding a shortest diagonal of a simple polygon in linear time

This page was built for publication: Matrix searching with the shortest path metric