Pages that link to "Item:Q909460"

The following pages link to A linear-time algorithm for concave one-dimensional dynamic programming (Q909460):

Displaying 21 items.

• New algorithms for facility location problems on the real line (Q517797) (← links)
• Speeding up dynamic programming in the line-constrained \(k\)-median (Q726094) (← links)
• Locating stops along bus or railway lines -- a bicriteria problem (Q816419) (← links)
• Online dynamic programming speedups (Q839641) (← links)
• Minimum \(L_k\) path partitioning-an illustration of the Monge property (Q924884) (← links)
• Sparse LCS common substring alignment (Q1029026) (← links)
• A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time (Q1183480) (← links)
• Dynamic programming with convexity, concavity and sparsity (Q1190452) (← links)
• Structured \(p\)-facility location problems on the line solvable in polynomial time (Q1382805) (← links)
• Consecutive interval query and dynamic programming on intervals (Q1392542) (← links)
• Strongly polynomial efficient approximation scheme for segmentation (Q1628675) (← links)
• Approximate regular expression pattern matching with concave gap penalties (Q1894715) (← links)
• Perspectives of Monge properties in optimization (Q1923588) (← links)
• Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon (Q2392920) (← links)
• A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time (Q2498983) (← links)
• Speeding up Dynamic Programming in the Line-Constrained k-median (Q2819512) (← links)
• Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane (Q2988724) (← links)
• Selection and sorting in totally monotone arrays (Q3979609) (← links)
• Efficient algorithms for centers and medians in interval and circular-arc graphs (Q4537621) (← links)
• A note on the traveling repairman problem (Q4785216) (← links)
• Shortest longest-path graph orientations (Q6591464) (← links)