Ok this is NP-comlete... so no fast algorithm is known........ 2009/3/12 Amina Maarouf <amina.maar...@gmail.com>
> Dear All; > > I need some help on the following problem: > > Given a weighted graph ( v, e) and a set of marked vertices v' subset to v > and a source node n. Find a cycle to that visits all vertices in v' and > returns to n, such that the total cost is minimum. > > if anyone has ideas of algorithms, or applications that may map to this > problem, it will be a great help to me. > > thanks > > amiiina > > > > --~--~---------~--~----~------------~-------~--~----~ 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 algogeeks+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
