> 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).]
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?