K 集合覆盖求解算法
大家好，
我在寻求建议。我已经研究 k 集合覆盖问题（及相关问题）超过一年了，我注意到目前没有已知的算法能够对每个实例进行最优解，并且任何能够做到这一点的算法在某些规模的问题上都需要花费太多时间。我认为对于这个问题的性质存在很大的误解，因为实际上有一种简单且快速的方法可以在合理的时间内解决所有这些问题，而我花了一整年时间只是用同样无聊的方式证明它适用于这一类别的所有问题。然而，现在我有一个非常高效的算法（在理论上），我知道这可能非常有用，但我缺乏合适的帮助和建议，我该如何处理它？
谢谢大家！
查看原文
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?<p>Thanks guys