We are two students in France and we work on soap bubbles. We would like to say a word in our presentation about the steiner tree problem. Unfortunately, we found no popular scientific work on this subject (since we are not specialists). We have three unanswered questions : - First, what would would be an exact algorithm for the steiner tree problem (even if it could not be able to give a solution for more than a few points) ? - How could we determine its complexity (to show that it is useless) ? - What are the ways to create unexact algorithm with smaller complexity to solve this problem ?
Thanks a lot for your help. --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
