Optimal Partitioning of Sequences
From MaRDI portal
Recommendations
Cited in
(23)- Partitioning a sequence into few monotone subsequences
- Partitioning of sequentially ordered systems using linear programming
- Strongly polynomial efficient approximation scheme for segmentation
- A short cut to optimal sequences
- Efficient partition of N-dimensional intervals in the framework of one-point-based algorithms
- Block partitions of sequences
- Queueing and glueing for optimal partitioning (functional pearl)
- Optimal Set Partitioning
- Optimal sequencing of a set of positive numbers with the variance of the sequence's partial sums maximized
- Optimal Consecutive-k-out-of-n:F Component Sequencing
- Optimum Scan-Width Selection Under Containment Constraints
- Minimum Spillage Sequencing
- scientific article; zbMATH DE number 4083632 (Why is no real title available?)
- Efficient partitioning of sequences
- Efficient array partitioning
- scientific article; zbMATH DE number 2115904 (Why is no real title available?)
- Optimal Partitioning Which Maximizes the Sum of the Weighted Averages
- Streaming partitioning of sequences and trees
- Sequential Partitioning
- An output-sensitive Algorithm to partition a Sequence of Integers into Subsets with equal Sums
- A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences
- Two-Dimensional partitioning problems
- Minimum \(L_k\) path partitioning-an illustration of the Monge property
This page was built for publication: Optimal Partitioning of Sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4845850)
