Login / Signup
Better lower and upper bounds for the minimum rainbow subgraph problem.
Alexandru Popa
Published in:
Theor. Comput. Sci. (2014)
Keyphrases
</>
lower and upper bounds
lower bound
upper bound
lower bounding
upper and lower bounds
np hard
lagrangian relaxation
graph mining
minimum cost
linear program
subgraph isomorphism
valid inequalities
search algorithm
linear programming
scheduling problem
search space
computational complexity