Need Help in this DP problem !

Правка en3, от FO7, 2023-08-17 14:47:59

Given a undirected graph(Total No of Nodes is 1e5) .each node has its beauty .each edge has its own time travel cost .U have some finite time say m(<=100).U are at root node of graph.U have to travel those nodes and return to root .find the maximum beauty that u can collect. Idea is by knapsack .But I am facing difficulty in calculating dp states.Please confirm if it is Np-hard problem .

Thanks

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en4 Английский FO7 2023-08-17 15:33:39 57
en3 Английский FO7 2023-08-17 14:47:59 41
en2 Английский FO7 2023-08-17 13:23:16 8 Tiny change: ' edge has time trav' -> ' edge has its own time trav'
en1 Английский FO7 2023-08-17 13:22:24 382 Initial revision (published)