耕种
发表于 2025-3-30 11:48:58
http://reply.papertrans.cn/17/1605/160462/160462_51.png
欢乐中国
发表于 2025-3-30 12:42:38
A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and OneWe present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one..As applications, we get a 5/4-approximation algorithm for the (minimum) asymmetric TSP with weights one and two and a 3/4-approximation algorithm for the Maximum Directed Path Packing Problem.
先兆
发表于 2025-3-30 17:27:23
http://reply.papertrans.cn/17/1605/160462/160462_53.png
NATAL
发表于 2025-3-30 21:18:46
Simultaneous Source Locationbe satisfied. We give an exact algorithm for trees and show how this can be combined with a result of Räcke to give a solution that exceeds edge capacities by at most .(log.. log log.), where . is the number of nodes. On graphs of bounded treewidth, we show the problem is still NP-Hard, but we are a
碳水化合物
发表于 2025-3-31 02:20:05
http://reply.papertrans.cn/17/1605/160462/160462_55.png
新义
发表于 2025-3-31 05:10:08
http://reply.papertrans.cn/17/1605/160462/160462_56.png
conifer
发表于 2025-3-31 11:18:44
http://reply.papertrans.cn/17/1605/160462/160462_57.png
津贴
发表于 2025-3-31 16:33:45
http://reply.papertrans.cn/17/1605/160462/160462_58.png
庄严
发表于 2025-3-31 19:21:53
http://reply.papertrans.cn/17/1605/160462/160462_59.png
下垂
发表于 2025-3-31 23:20:57
http://reply.papertrans.cn/17/1605/160462/160462_60.png