2 citations · 3 across the 8 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Weighted Upper Edge Cover: Complexity and Approximability
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jerome Monnot +1
Optimization problems consist of either maximizing or minimizing an objective function. Instead of looking for a maximum solution (resp. minimum solution), one can find a minimum m…
math.CO2018
Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs
Alexandre Bazin, Laurent Beaudou, Giacomo Kahn +1
We bound the number of minimal hypergraph transversals that arise in tri-partite 3-uniform hypergraphs, a class commonly found in applications dealing with data. Let H be such a hy…