K Set Cover Solving Algorithm
Hello everyone, I’m looking for advice. I’ve been studying the k set cover problem (and related problems) for over a year, I’ve noticed that there is no known algorithm that can solve this problem for every instance optimal and any algorithm that does so, just takes to much time if the problem is of certain size. I think there is a big misconception about the nature of this problem because there is an easy and fast way to just solve all of them within reasonable amount of time and I’ve spent a whole year just proving that it works for any problem of this category the same boring way. Now however I have I have a very efficient algorithm (on paper), I know this could be extremely useful, but Im just lacking the right help and advices, what should I do with it?
wunderpus@mail.com
Thanks guys
This problem? https://en.wikipedia.org/wiki/Set_cover_problem
> Now however I have a very efficient algorithm (on paper)
Why not code?
> I’ve spent a whole year just proving that it works for any problem of this category the same boring way
I don't know enough about this problem, but it's common that most examples are easy and can be solved with an efficient heuristic, but there are an infinite family of rare corner cases were the heuristic fails and the solution is very slow.
[IIRC, for the traveling salesman problem, the hard cases are when the distances are just small differences 1.0001912876; 1.0010221987; 1.01002112; 1.030152322; 1.01026; 1.0102131287; ... or something like that (this are just numbers I typed randomly).]
Isn’t this an NP hard problem?
Publish it on arxiv?
[flagged]