The LinearSplit package
The LinearSplit module implements partitioning the sequence of items to the subsequences in the order given. The items can be splitted using greedy heuristic or using the linear partition algorithm to minimize the maximum cost over all ranges (see the 'The Algorithm Design Manual' by Steven S. Skiena..)
Properties
| Versions | 0.1, 0.2, 0.2.1 |
|---|---|
| Dependencies | array, base (≥3.0.3.2 & <5), cmdargs (≥0.3), haskell98, QuickCheck (≥1.2.0.1) |
| License | BSD3 |
| Author | Vitaliy Rukavishnikov |
| Maintainer | virukav@gmail.com |
| Category | Algorithms |
| Home page | http://github.com/rukav/LinearSplit |
| Bug tracker | mailto:virukav@gmail.com |
| Upload date | Sat Feb 19 22:35:22 UTC 2011 |
| Uploaded by | VitaliyRukavishnikov |
| Built on | ghc-7.0 |
Modules
- Data
Downloads
- LinearSplit-0.2.tar.gz (Cabal source package)
- package description (included in the package)