Yes! Look here there is a program: http://groups.google.com/group/algogeeks/browse_thread/thread/11b032a28995baed/7b896ee015b090e5
On Feb 13, 3:16 am, conundrum <[EMAIL PROTECTED]> wrote: > Given a text and a set of keywords, is there a linear time algorithm > to find the smallest subtext containing all the keywords (at least > once) ? --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
