Minimum Lk path partitioning-An illustration of the Monge property

Authors:
Pei-Hao Ho;Arie Tamir;Bang Ye Wu
Affiliations:
Department of Computer Science and Information Engineering, Shu-Te University, YenChau, KaoShiung 824, Taiwan, ROC;Department of Statistics and Operations Research, School of Mathematical Sciences, Tel Aviv University, Israel;Department of Computer Science and Information Engineering, Shu-Te University, YenChau, KaoShiung 824, Taiwan, ROC
Venue:
Operations Research Letters
Year:
2008

Citing 12
Cited 1

Partitions of chains with minimum imbalance

Cahiers du Centre d'Etudes de Recherche Operationelle
The concave least-weight subsequence problem revisited

Journal of Algorithms
A linear-time algorithm for concave one-dimensional dynamic programming

Information Processing Letters
Sequence comparison with mixed convex and concave costs

Journal of Algorithms
An almost linear time algorithm for generalized matrix searching

SIAM Journal on Discrete Mathematics
Optimal algorithms for tree partitioning

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Dynamic programming with convexity, concavity and sparsity

Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Most uniform path partitioning and its use in image processing

Discrete Applied Mathematics - Special issue: combinatorial structures and algorithms
Optimal partitioning of sequences

Journal of Algorithms
Efficient Partitioning of Sequences

IEEE Transactions on Computers
A Simple Linear Time Algorithm for Concave One-Dimensional Dynamic Programming

A Simple Linear Time Algorithm for Concave One-Dimensional Dynamic Programming
Improved complexity bounds for location problems on the real line

Operations Research Letters

New algorithms for 1-D facility location and path equipartition problems

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the problem of cutting a given sequence of positive real numbers into p pieces, with the objective of minimizing the L"k norm of the sums of the numbers in these pieces. We observe that this problem satisfies a Monge property, and thus derive fast algorithms for it.