REP 发表于 2025-4-1 02:17:32
http://reply.papertrans.cn/47/4683/468259/468259_61.pngmiracle 发表于 2025-4-1 08:40:57
http://reply.papertrans.cn/47/4683/468259/468259_62.png使虚弱 发表于 2025-4-1 11:52:45
http://reply.papertrans.cn/47/4683/468259/468259_63.pngKaleidoscope 发表于 2025-4-1 15:38:33
,Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Min paths starting at a prescribed root node, so as to minimize the sum of the node visiting times. Our combinatorial algorithm allows us to sidestep the part where we solve a preflow-based LP in the LP-rounding algorithms of [.] for orienteering, and in the state-of-the-art 7.183-approximation algorit