Algorithms for finding the maximum-density path and maximum subarray problems
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 92 === We propose some algorithms to solve two problems in this thesis. The first problem is to find a length-constrained maximum-density path in a tree. Given a tree with n edges, we present two efficient algorithm for finding a maximum-density path of length at least...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/53796339105555842330 |
| Summary: | 碩士 === 國立臺灣大學 === 資訊工程學研究所 === 92 === We propose some algorithms to solve two problems in this thesis. The first problem is to find a length-constrained maximum-density path in a tree. Given a tree with n edges, we present two efficient algorithm for finding a maximum-density path of length at least L in O(nL) time. One of them is further modified to solve full m-ary trees in O(n) time. The other problem is to find the maximum subarray in a two-dimensional array. Given an m×n array of numbers, we develop two heuristic algorithms for computing the maximum subarray in O(nm + km^2), where k is a given parameter. Preliminary experiments show that these approaches are very promising for locating the maximum subarray in a given two-dimensional array.
|
|---|