辽宁石油化工大学学报

辽宁石油化工大学学报 ›› 2007, Vol. 27 ›› Issue (3): 49-52.

• 计算机与自动化 • 上一篇    下一篇

线性划分问题的一个改进算法

刘金义   

  1. 辽宁石油化工大学计算机与通信工程学院,辽宁抚顺 113001
  • 收稿日期:2006-11-07 出版日期:2007-09-20 发布日期:2017-07-23

An Improved Algorithm for the Linear Partition Problem

LIU Jin-yi   

  1. School of Computer and Communication Engineering, Liaoning University of Petroleum & Chemical Technology, Fushun Liaoning 113001, P. R. China
  • Received:2006-11-07 Published:2007-09-20 Online:2017-07-23

摘要: 给定一个由n个非负数构成的序列X={x1, x2, …, xn}及正整数k≤n, 线性划分问题要求将该序列划分为不大于k段子序列,使得最小化各段子序列元素之和为最大值。目前已知该问题的最好算法是时间复杂度为O(kn2)和空间复杂度为O(kn)的动态规划算法。利用非负数序列的性质,给出一个快速改进算法,其时间复杂度为O(knlogn),空间复杂度为O(n)。

关键词: 算法, 时间复杂度, 空间复杂度, 线性划分问题

Abstract: Given a sequence X={x1,x2,…,xn} with n non-negative numbers and a positive integer k≤n, the linear partition problem requires to partition X into k or less than k subsequences, so as to minimize the maximum sum of elements over all subsequences. The known best algorithm for this problem is a dynamic programming algorithm with time complexity O(kn2) and space complexity O(kn). By using the properties of the non-negative sequence, an improved algorithm with time complexity O(knlogn) and space complexity O(n) was given.

Key words: Algorithm, Time complexity, Space complexity, Linear partition problem.

引用本文

刘金义. 线性划分问题的一个改进算法[J]. 辽宁石油化工大学学报, 2007, 27(3): 49-52.

LIU Jin-yi. An Improved Algorithm for the Linear Partition Problem[J]. Journal of Liaoning Petrochemical University, 2007, 27(3): 49-52.

使用本文

0
    /   /   推荐

导出引用管理器 EndNote|Ris|BibTeX

链接本文: https://journal.lnpu.edu.cn/CN/

               https://journal.lnpu.edu.cn/CN/Y2007/V27/I3/49