The concave least-weight subsequence problem revisited

From MaRDI portal
Revision as of 14:10, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3796787

DOI10.1016/0196-6774(88)90032-6zbMath0651.68093OpenAlexW2057640376WikidataQ56520005 ScholiaQ56520005MaRDI QIDQ3796787

Robert Wilber

Publication date: 1988

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(88)90032-6




Related Items (28)

A note on the traveling repairman problemFinding least-weight subsequences with fewer processorsFinding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applicationsOnline dynamic programming speedupsSelection and sorting in totally monotone arraysApproximate regular expression pattern matching with concave gap penaltiesSpeeding up dynamic programming with applications to molecular biologySpanning trees and shortest paths in Monge graphsStructured \(p\)-facility location problems on the line solvable in polynomial timePerspectives of Monge properties in optimizationConsecutive interval query and dynamic programming on intervalsOn three soft rectangle packing problems with guillotine constraintsMonge properties of sequence alignmentA linear-time algorithm for concave one-dimensional dynamic programmingApplications of generalized matrix searching to geometric algorithmsMinimum \(L_k\) path partitioning-an illustration of the Monge propertyImproved complexity bounds for location problems on the real lineA special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) timeDynamic programming with convexity, concavity and sparsityNew algorithms for facility location problems on the real lineComputing an eigenvector of a Monge matrix in max-plus algebraThe \(k\)-centrum multi-facility location problemThe algebraic Monge property and path problemsDistribution-aware compressed full-text indexesUnnamed ItemOn some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication linesMonge strikes again: Optimal placement of web proxies in the internetA faster off-line algorithm for the TCP acknowledgement problem.







This page was built for publication: The concave least-weight subsequence problem revisited