Pages that link to "Item:Q1101223"
From MaRDI portal
The following pages link to Geometric applications of a matrix-searching algorithm (Q1101223):
Displayed 50 items.
- 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)
- Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood (Q1805008) (← links)
- A Monge property for the \(d\)-dimensional transportation problem (Q1805449) (← links)
- Optimal shortest path queries in a simple polygon (Q1823689) (← links)
- Approximate regular expression pattern matching with concave gap penalties (Q1894715) (← links)
- Finding a closet visible vertex pair between two polygons (Q1899450) (← links)
- On the recognition of permuted bottleneck Monge matrices (Q1902890) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- Unified compression-based acceleration of edit-distance computation (Q1939664) (← links)
- An almost linear time algorithm for field splitting in radiation therapy (Q1947981) (← links)
- An improved algorithm for tree edit distance with applications for RNA secondary structure comparison (Q2015811) (← links)
- \(L_{1}\) shortest path queries in simple polygons (Q2272388) (← links)
- Properties of the \(d\)-dimensional Earth mover's problem (Q2312655) (← links)
- The complexity of optimization on grids (Q2319631) (← links)
- Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time (Q2349742) (← links)
- Fast distance multiplication of unit-Monge matrices (Q2350900) (← links)
- Resequencing a set of strings based on a target string (Q2354022) (← links)
- Finding least-weight subsequences with fewer processors (Q2366242) (← links)
- Approximating points by a piecewise linear function (Q2375945) (← links)
- Efficient algorithms for finding interleaving relationship between sequences (Q2380070) (← links)
- Dynamic lot-sizing model for major and minor demands (Q2384637) (← links)
- Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon (Q2392920) (← links)
- Maximizing the overall end-user satisfaction of data broadcast in wireless mesh networks (Q2407947) (← links)
- Monge properties, discrete convexity and applications (Q2432877) (← links)