One of Karp\'s 21 NP-hard problem implementation
$30-250 USD
Paid on delivery
Choose one of Karp's 21 NP-hard problems and write java code to obtain
the TRUE PERFECT answer by iterating through every possible sequence of numbers
(termed a 'brute-force' algorithm.) So, greedy or approximate algorithms would not be
appropriate since they don't guarantee the true perfect solution. It should be done in Java, properly commented and assume that the input
is read from a file and the output is to a file.
Would be due 5/19/13.
Below is a link to Karp's 21 NP-hard problems
[url removed, login to view]~jeffe/teaching/algorithms/notes/[url removed, login to view]
Project ID: #4533492