scientific article; zbMATH DE number 432798

MaRDI QIDQ3138931zbMATH OpenFDO

Authors David Eppstein, Giuseppe F. Italiano, Zvi Galil, R. Giancarlo

Publication date 15 December 1993

zbMATH Keywords

sparsity

Mathematics Subject Classification ID

Dynamic programming (90C39)

Recommendations

• Sparse dynamic programming I
• Speeding up dynamic programming with applications to molecular biology
• Sparse dynamic programming II
• Publication:4206397
• Sparse Dynamic Programming for Longest Common Subsequence from Fragments

Cited in

(16)

• A discipline of dynamic programming over sequence data
• Finding the k smallest spanning trees
• Text sparsification via local maxima.
• An optimal algorithm with unknown time complexity for convex matrix searching
• Finding least-weight subsequences with fewer processors
• A Monge property for the \(d\)-dimensional transportation problem
• Homomorphic hashing for sparse coefficient extraction
• Consecutive interval query and dynamic programming on intervals
• Finding the \(k\) smallest spanning trees
• scientific article; zbMATH DE number 2080210 (Why is no real title available?)
• Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon
• An almost quadratic time algorithm for sparse spliced alignment
• Dynamic programming with convexity, concavity and sparsity
• Fast and cache-oblivious dynamic programming with local dependencies
• Sparse dynamic programming on DAGs with small width
• Cache efficient simple dynamic programming

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138931)