Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence

Let A be a sequence of n>=0 real numbers. A subsequence of A is a sequence of contiguous elements of A. A maximum scoring subsequence of A is a subsequence with largest sum of its elements, which can be found in O(n) time by Kadane@?s dynamic programming algorithm. We consider in this paper two problems involving maximal scoring subsequences of a sequence. Both of these problems arise in the context of sequencing tasks to minimize the maximum renewal cumulative cost. The first one, which is called INSERTION IN A SEQUENCE WITH SCORES (ISS), consists in inserting a given real number x in A in such a way to minimize the sum of a maximum scoring subsequence of the resulting sequence, which can be easily done in O(n^2) time by successively applying Kadane@?s algorithm to compute the maximum scoring subsequence of the resulting sequence corresponding to each possible insertion position for x. We show in this paper that the ISS problem can be solved in linear time and space with a more specialized algorithm. The second problem we consider in this paper is the SORTING A SEQUENCE BY SCORES (SSS) one, stated as follows: find a permutation A^' of A that minimizes the sum of a maximum scoring subsequence. We show that the SSS problem is strongly NP-Hard and give a 2-approximation algorithm for it.

[1]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[2]  Edson Cáceres,et al.  A BSP/CGM Algorithm for Finding All Maximal Contiguous Subsequences of a Sequence of Numbers , 2006, Euro-Par.

[3]  M. Csűros,et al.  Maximum-scoring segment sets , 2004, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[4]  Miklós Csürös,et al.  Maximum-Scoring Segment Sets , 2004, IEEE ACM Trans. Comput. Biol. Bioinform..

[5]  Allan Grønlund Jørgensen,et al.  Selecting Sums in Arrays , 2008, ISAAC.

[6]  Allan Grønlund Jørgensen,et al.  A Linear Time Algorithm for the k Maximal Sums Problem , 2007, MFCS.

[7]  Deeparnab Chakrabarty,et al.  Knapsack Problems , 2008 .

[8]  Walter L. Ruzzo,et al.  A Linear Time Algorithm for Finding All Maximal Scoring Subsequences , 1999, ISMB.

[9]  Jon Bentley,et al.  Programming pearls: algorithm design techniques , 1984, CACM.

[10]  David Gries,et al.  A Note on a Standard Strategy for Developing Loop Invariants and Loops , 1982, Sci. Comput. Program..

[11]  Hung-Chi Su,et al.  A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences , 2006, LATIN.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Serge Fdida,et al.  Scheduling links for heavy traffic on interfering routes in wireless mesh networks , 2011, Comput. Networks.

[14]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[15]  Tadao Takaoka,et al.  Algorithms for the problem of K maximum sums and a VLSI algorithm for the K maximum subarrays problem , 2004, 7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings..

[16]  David B. Shmoys,et al.  Using Dual Approximation Algorithms for Scheduling Problems: Theoretical and Practical Results , 1985, FOCS.

[17]  Tsai Li-Hui.  Sequencing to minimize the maximum renewal cumulative cost , 1992, Oper. Res. Lett..

[18]  Luca Foschini,et al.  Balanced Partitions of Trees and Applications , 2012, Algorithmica.