NP — Online Judge

Revision en2, by BlueDiamond, 2020-10-06 13:47:08

Hey!

I think it would be cool to have a place where we could compare our heuristics for different NP problems.

Evaluating one task can be done like this: Making something like 1000 tests (or more) and placing them in a zip archive. The people than download this archive and run their program at home (without any time limit). Just like Facebook HackerCup. The grading is done by the following criteria: let's say that we are dealing with the task of the maximum clique. You need to return the size of the clique and its nodes. First of all, if there is at least one test on which the returned nodes don't form a clique, your program gets 0 points. In the other case its scoring is equal to the sum of sizes of the cliques for all of the tests.

I am talking about classical NP tasks such as: maximum clique, complete coloring, minimal cover, traveling salesman aaaaaand many more!

PS: Do you know some place to "test" NP tasks heuristics that already exists? (And to be able to compare your program performance to the performance of other programs).

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English BlueDiamond 2020-10-06 13:47:08 145
en1 English BlueDiamond 2020-10-03 11:05:12 943 Initial revision (published)