Pages that link to "Item:Q1101223"
From MaRDI portal
The following pages link to Geometric applications of a matrix-searching algorithm (Q1101223):
Displaying 50 items.
- An efficient algorithm for on-line searching of minima in Monge path-decomposable tridimensional arrays (Q293394) (← links)
- One-dimensional approximate point set pattern matching with \(L_p\)-norm (Q389940) (← links)
- Improved algorithms for path partition and related problems (Q408433) (← links)
- Monge properties of sequence alignment (Q418004) (← links)
- New algorithms for facility location problems on the real line (Q517797) (← links)
- Shape rectangularization problems in intensity-modulated radiation therapy (Q534786) (← links)
- Coupled path planning, region optimization, and applications in intensity-modulated radiation therapy (Q547283) (← links)
- Finding the largest area axis-parallel rectangle in a polygon (Q676593) (← links)
- Monge and feasibility sequences in general flow problems (Q686244) (← links)
- Geometric Knapsack problems (Q689105) (← links)
- Minimizing a sum of submodular functions (Q713320) (← links)
- Speeding up dynamic programming in the line-constrained \(k\)-median (Q726094) (← links)
- On the modality of convex polygons (Q748888) (← links)
- Finding a largest-area triangle in a terrain in near-linear time (Q832865) (← links)
- On the symmetric angle-restricted nearest neighbor problem (Q834915) (← links)
- Online dynamic programming speedups (Q839641) (← links)
- Dynamic programming algorithms for the mosaic longest common subsequence problem (Q845973) (← links)
- A linear-time algorithm for concave one-dimensional dynamic programming (Q909460) (← links)
- On the angle restricted nearest neighbor problem (Q910232) (← links)
- Computing Euclidean maximum spanning trees (Q911288) (← links)
- Applications of generalized matrix searching to geometric algorithms (Q913505) (← links)
- An optimal algorithm with unknown time complexity for convex matrix searching (Q917275) (← links)
- Computing the longest diagonal of a simple polygon (Q917298) (← links)
- A dynamic data structure for top-\(k\) queries on uncertain data (Q955007) (← links)
- Sparse LCS common substring alignment (Q1029026) (← links)
- Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time (Q1029706) (← links)
- Parallel computational geometry (Q1115600) (← links)
- A note on lower bounds for the maximum area and maximum perimeter k-gon problems (Q1123609) (← links)
- A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time (Q1183480) (← links)
- Finding minimum area \(k\)-gons (Q1186081) (← links)
- Dynamic programming with convexity, concavity and sparsity (Q1190452) (← links)
- Efficient algorithms for the largest rectangle problem (Q1193696) (← links)
- Optimal time bounds for some proximity problems in the plane (Q1198024) (← links)
- The convex-hull-and-line traveling salesman problem: A solvable case (Q1332749) (← links)
- Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications (Q1338956) (← links)
- A unified linear-time algorithm for computing distance maps (Q1350616) (← links)
- \(k\) best cuts for circular-arc graphs (Q1355722) (← links)
- Spanning trees and shortest paths in Monge graphs (Q1382772) (← links)
- Structured \(p\)-facility location problems on the line solvable in polynomial time (Q1382805) (← links)
- On finding an empty staircase polygon of largest area (width) in a planar point-set (Q1405008) (← links)
- Monge strikes again: Optimal placement of web proxies in the internet (Q1593707) (← links)
- A faster off-line algorithm for the TCP acknowledgement problem. (Q1603523) (← links)
- On optimal bridges between two convex regions (Q1607067) (← links)
- Strongly polynomial efficient approximation scheme for segmentation (Q1628675) (← links)
- Tiers for peers: a practical algorithm for discovering hierarchy in weighted networks (Q1741316) (← links)
- Discovering recurring activity in temporal networks (Q1741356) (← links)
- On the number of maximum empty boxes amidst \(n\) points (Q1745207) (← links)
- On almost Monge all scores matrices (Q1755777) (← links)
- Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
- The algebraic Monge property and path problems (Q1765525) (← links)
