1

I have n video files, while each file has the size s_n. I have DVDs with a max size of 4.7 GB. Which program - or algorithm that I can simply implement in c# - gives me playlists for each DVD that I can use to copy the files to the DVDs, using the space as good as possible?

I know, it is a knapsack problem.

OS: Windows 7
Price: free
  • 1
    Knapsack should not be an issue for small n. What is n roughly in your case? – Thomas Weller Feb 4 '16 at 8:27
  • @Thomas: ninety. – Fabien Biller Feb 4 '16 at 10:08

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.