Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Sparse problem setting (unicost) #6

Open
hellman opened this issue Jul 7, 2022 · 1 comment
Open

Sparse problem setting (unicost) #6

hellman opened this issue Jul 7, 2022 · 1 comment

Comments

@hellman
Copy link

hellman commented 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.

@hellman hellman changed the title Sparse problem setting Sparse problem setting (unicost) Jul 7, 2022
@mengxiaolin
Copy link

I asked the same question about 1 year ago。unicost and sparse matrix will make this tool more practical useful.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants