You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Is the algorithm also applicable to sparse problems? (particularly, with unicost 1)
As far as I understand, currently the problem has to be encoded as matrix, which can take too much space for sparse problems (small sets).
Of course SetCover is hard and quadratic time is not much, but many practical problems have many elements and many small sets, and the quadratic (matrix) formulation would simply take too much space, although it could actually be solvable with many methods.
The text was updated successfully, but these errors were encountered:
hellman
changed the title
Sparse problem setting
Sparse problem setting (unicost)
Jul 7, 2022
Hello,
Is the algorithm also applicable to sparse problems? (particularly, with unicost 1)
As far as I understand, currently the problem has to be encoded as matrix, which can take too much space for sparse problems (small sets).
Of course SetCover is hard and quadratic time is not much, but many practical problems have many elements and many small sets, and the quadratic (matrix) formulation would simply take too much space, although it could actually be solvable with many methods.
The text was updated successfully, but these errors were encountered: