Now showing items 1-2 of 2
Average case analysis of algorithms for the maximum subarray problem
(University of Canterbury. Computer Science and Software Engineering, 2007)
Maximum Subarray Problem (MSP) is to find the consecutive array portion that maximizes the sum of array elements in it. The goal is to locate the most useful and informative array segment that associates two parameters ...
Combining Shortest Paths, Bottleneck Paths and Matrix Multiplication
(University of Canterbury. Computer Science and Software Engineering, 2014)
We provide a formal mathematical definition of the Shortest Paths for All Flows (SP-AF) problem and provide many efficient algorithms. The SP-AF problem combines the well known Shortest Paths (SP) and Bottleneck Paths (BP) ...