blob: a554bac2b6a89c4a767fa3a9b8167782d591bc42 (
plain)
1
2
3
4
5
6
7
8
9
10
11
|
Truly linear time implementation of the greedy algorithm for set cover.
TODO:
-----
* clean up code, deallocate data structure at the end, check for memory leaks
* proper storing of the solutions
* add support for decoding of binary instances
* add budgeted variant
* benchmark against map-based implementation and competing implementations
* write Python wrapper
|
