carl
24.04
Computer ARithmetic Library
|
Go to the source code of this file.
Namespaces | |
carl | |
carl is the main namespace for the library. | |
carl::covering | |
carl::covering::heuristic | |
Functions | |
Bitset | carl::covering::heuristic::greedy (SetCover &sc) |
Simple greedy heuristic: Selects the largest remaining set until all elements are covered. More... | |
Bitset | carl::covering::heuristic::greedy_bounded (SetCover &sc, std::size_t bound=12) |
Bounded greedy heuristic: Selects the largest remaining set until at most bound constraints remain. More... | |
Bitset | carl::covering::heuristic::greedy_weighted (SetCover &sc, const std::vector< double > &weights, std::size_t bound=0) |
Weighted greedy heuristic: Selects the largest remaining set according to the given weight function until at most bound constraints remain. More... | |