Re: [boost] GSoC 2013 : Implementing Dynamic Programming Algorithms

Subject: Re: [boost] GSoC 2013 : Implementing Dynamic Programming Algorithms
From: Rahul Sr (srivasrrahul_at_[hidden])
Date: 2013-04-09 07:17:48

Can you point out what exactly you want to implement?
Your list is too huge in current form and would require huge amount of
effort to implement completely.

Regards,
Rahul

On Tue, Apr 9, 2013 at 4:52 AM, Aman Gupta <amangupta052_at_[hidden]> wrote:

> Hi,
>
> I am Aman Gupta from BITS-Pilani India, I am a 4th year Undergraduate
> Student majoring in Computer Science.
>
> I've noticed that boost does not contain dynamic programming algorithms
> like Integer-Knapsack, Longest Common Sub-sequence.
>
> I was thinking that implementing this would be a good project. I realize
> most of these problems are non-polynomial in complexity but I was thinking
> implementing them to a
> certain size will not be problem.
> Also, since some of the dynamic programming algorithms have alternate
> greedy algorithms which compromise on correctness but are faster,
> implementing those can be useful.
> The knapsack problem(which comes in a lot of situations) for which there
> exists an algorithm which gives an arbitrarily close approximation to the
> optimal value can be implemented.
> ( e.g. f(weights,values,error)  could be the function, the user has a
> trade-off between error and computation time).
> I think it could be useful in situations where the user just decides the
> error he wants or perhaps how fast he wants his computation.
>
> Please let me know if this seems like a valid project idea to you!
>
> Thanks,
> Aman Gupta
>
> _______________________________________________
> Unsubscribe & other changes:
> http://lists.boost.org/mailman/listinfo.cgi/boost
>