carl  24.04
Computer ARithmetic Library
greedy.h File Reference
#include "../SetCover.h"
#include "../TypedSetCover.h"
Include dependency graph for greedy.h:
This graph shows which files directly or indirectly include this file:

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...
 
template<typename T , typename F >
auto carl::covering::heuristic::greedy_weighted (TypedSetCover< T > &tsc, F &&weight, 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...