The following pages link to (Q3138931):
Displaying 6 items.
- An optimal algorithm with unknown time complexity for convex matrix searching (Q917275) (← links)
- Finding the \(k\) smallest spanning trees (Q1196455) (← links)
- Consecutive interval query and dynamic programming on intervals (Q1392542) (← links)
- A Monge property for the \(d\)-dimensional transportation problem (Q1805449) (← links)
- Finding least-weight subsequences with fewer processors (Q2366242) (← links)
- Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon (Q2392920) (← links)
