Matrix Searching with the Shortest-Path Metric
From MaRDI portal
Publication:4376191
DOI10.1137/S0097539793253577zbMATH Open0885.68086OpenAlexW2016984768MaRDI QIDQ4376191FDOQ4376191
Authors: John Hershberger, Subhash Suri 
Publication date: 10 February 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539793253577
Recommendations
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Searching and sorting (68P10)
Cited In (20)
- Rectilinear link diameter and radius in a rectilinear polygonal domain
- Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
- Computing the geodesic centers of a polygonal domain
- A linear-time algorithm for the geodesic center of a simple polygon
- Diffuse reflection radius in a simple polygon
- Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time
- Convex hulls in polygonal domains
- Rectilinear link diameter and radius in a rectilinear polygonal domain
- External matrix multiplication and all-pairs shortest path
- Title not available (Why is that?)
- Pareto envelopes in simple polygons
- The geodesic diameter of polygonal domains
- Maximal distortion of geodesic diameters in polygonal domains
- An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons
- \(L_{1}\) shortest path queries in simple polygons
- Geometric path problems with violations
- \(L_1\) geodesic farthest neighbors in a simple polygon and related problems
- Applications of generalized matrix searching to geometric algorithms
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain
- The geodesic farthest-point Voronoi diagram in a simple polygon
This page was built for publication: Matrix Searching with the Shortest-Path Metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376191)
