most citedExtension of vertex cover and independent set in some classes of graphs and generalizations

3 citations · 3 across the 1 of their papers we have counts for

collaborators
Showing cs.DSShow 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…

cs.DS2018

How Bad is the Freedom to Flood-It?

Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi +2

Fixed-Flood-It and Free-Flood-It are combinatorial problems on graphs that generalize a very popular puzzle called Flood-It. Both problems consist of recoloring moves whose goal is…