» ASP Competition | |
|
Weight-Bounded Dominating Set Optimization VersionProblem description This problem modifies its corresponding decision problem by minimizing the cardinality of weight-bounded dominating sets D.
For a given directed graph G = (V,E),
the objective function to minimize is as follows: Input formatSee corresponding decision problem. Output formatSee corresponding decision problem Author: Lengning Liu, Miroslaw Truszczynski, and Martin Gebser |