I found a number of real life applications for the problem, like garbage
collection, a version of postman problem, gas system construction.. I am
looking for applications for the problem in networks, if any one can help.
On 3/14/09, Miroslav Balaz wrote:
>
>
> NP what?
> 2009/3/13 A
NP complete, sorry
On 3/14/09, Miroslav Balaz wrote:
>
>
> NP what?
> 2009/3/13 Amina Maarouf
>
>> this problem was proved to be NP in a conference paper published recently.
>>
>>
>>
>> On Fri, Mar 13, 2009 at 10:44 AM, Miroslav Balaz > > w
AM, Miroslav Balaz
>> wrote:
>>
>>> Ok this is NP-comlete... so no fast algorithm is known
>>>
>>> 2009/3/12 Amina Maarouf
>>>
>>> Dear All;
>>>>
>>>> I need some help on the following problem:
>>>
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 applica
