diff options
| author | Thibaut Horel <thibaut.horel@gmail.com> | 2015-07-02 16:12:16 -0700 |
|---|---|---|
| committer | Thibaut Horel <thibaut.horel@gmail.com> | 2015-07-02 16:12:16 -0700 |
| commit | 325651e8aa7775b8bc4ca3df054c6985d229c7f9 (patch) | |
| tree | 75e3bf405048e27cb2640279ebd59bdc18ec7986 | |
| parent | a7aab981196532cfecf9b23d1d68734b839a2aaf (diff) | |
| download | cover-325651e8aa7775b8bc4ca3df054c6985d229c7f9.tar.gz | |
Add README
| -rw-r--r-- | README.rst | 11 |
1 files changed, 11 insertions, 0 deletions
diff --git a/README.rst b/README.rst new file mode 100644 index 0000000..a554bac --- /dev/null +++ b/README.rst @@ -0,0 +1,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 |