by Fredrik Manne, Tor S#revik
IEEE Transactions on Computers
http://www.ii.uib.no/publikasjoner/texrap/ps/1992-62.ps
Add To MetaCart
Abstract:
The problem of partitioning a sequence of n real numbers into p intervals is considered. The goal is to nd a partition such that the cost of the most expensive interval measured with a cost function f is minimized. An eOEcient algorithm which solves the problem in time O(p(n \Gamma p) log p) is developed. The algorithm is based on nding a sequence of feasible nonoptimal partitions, each having only one way it can be improved to get a better partition. Finally a number of related problems are considered and shown to be solvable by slight modications of our main algorithm.
Citations
|
175
|
Optimization and approximation in deterministic sequencing and scheduling-A survey
– Graham, Lawler, et al.
- 1979
|
|
139
|
The role of elimination trees in sparse factorization
– Liu
- 1990
|
|
85
|
Complexity Results for Multiprocessor Scheduling Under Resource Constraints
– Garey, Johnson
- 1975
|
|
72
|
Partitioning Problems in Parallel, Pipelined, and Distributed Computing
– Bokhari
- 1988
|
|
25
|
Speed-up in dynamic programming
– Yao
- 1982
|
|
21
|
Parallel algorithms for banded linear systems
– Wright
- 1991
|
|
15
|
Improved algorithms for economic lot size problems
– Aggarwal, Park
|
|
14
|
Structured partitioning problems
– Anily, Federgruen
- 1991
|
|
14
|
Improved algorithms for partitioning problems in parallel, pipelined, and distributed computing
– Hansen, Lih
- 1992
|
|
14
|
Load Balancing in Parallel Sparse Matrix Computations
– Manne
- 1993
|
|
12
|
Divide and conquer methods for block tridiagonal systems
– Mehrmann
|
|
11
|
Data Communications, Computer Networks and OSI
– Halsall
- 1988
|
|
8
|
Optimal algorithms for partitioning trees and locating p-centers in trees
– Frederickson
- 1990
|
|
3
|
An algorithm for computing an elimination tree of minimum height for a tree
– Manne
- 1991
|
|
3
|
Tysdahl, Improving the computational complexity of active contour algorithms
– Olstad, E
- 1993
|
|
1
|
EOEcient partitioning of sequences with an application to sparse matrix computations
– Olstad, Manne
- 1993
|
