Pages that link to "Item:Q3796787"

The following pages link to The concave least-weight subsequence problem revisited (Q3796787):

Displaying 29 items.

• Monge properties of sequence alignment (Q418004) (← links)
• New algorithms for facility location problems on the real line (Q517797) (← links)
• Online dynamic programming speedups (Q839641) (← links)
• A linear-time algorithm for concave one-dimensional dynamic programming (Q909460) (← links)
• Applications of generalized matrix searching to geometric algorithms (Q913505) (← links)
• Minimum \(L_k\) path partitioning-an illustration of the Monge property (Q924884) (← links)
• Speeding up dynamic programming with applications to molecular biology (Q1121182) (← links)
• Improved complexity bounds for location problems on the real line (Q1180820) (← 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)
• The smallest upravel (Q1193744) (← links)
• Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications (Q1338956) (← 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)
• Consecutive interval query and dynamic programming on intervals (Q1392542) (← 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)
• The algebraic Monge property and path problems (Q1765525) (← links)
• Approximate regular expression pattern matching with concave gap penalties (Q1894715) (← links)
• Perspectives of Monge properties in optimization (Q1923588) (← links)
• Distribution-aware compressed full-text indexes (Q2017875) (← links)
• On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines (Q2043623) (← links)
• Finding least-weight subsequences with fewer processors (Q2366242) (← links)
• On three soft rectangle packing problems with guillotine constraints (Q2423793) (← links)
• Computing an eigenvector of a Monge matrix in max-plus algebra (Q2474561) (← links)
• Selection and sorting in totally monotone arrays (Q3979609) (← links)
• A note on the traveling repairman problem (Q4785216) (← links)
• (Q5091168) (← links)
• The \(k\)-centrum multi-facility location problem (Q5931794) (← links)