Heart-Rate
发表于 2025-3-27 00:53:09
http://reply.papertrans.cn/17/1605/160462/160462_31.png
Loathe
发表于 2025-3-27 01:55:47
https://doi.org/10.1007/978-3-319-74908-2pping. The total additive distortion is the sum of errors in all pairwise distances in the input data. This problem has been shown to be NP-hard by . We give an .(log.) approximation for this problem by using Garg .’s algorithm for the multi-cut problem as a subroutine. Our algorithm also g
独轮车
发表于 2025-3-27 07:48:27
Dynamics of Geodesic and Horocyclic Flows,hs of at most logarithmic radius, an .(log..) additive approximation algorithm is known, hence our lower bound is tight. To the best of our knowledge, this is the first tight additive polylogarithmic approximation result.
绅士
发表于 2025-3-27 12:48:53
Jouni Parkkonen,Frédéric Paulinontains two variables. Hastad shows that this problem is NP-hard to approximate within a ratio of 11/12 + . for .=2, and Andersson, Engebretsen and Hastad show the same hardness of approximation ratio for . ≥ 11, and somewhat weaker results (such as 69/70) for . = 3,5,7. We prove that max-2lin. is e
IOTA
发表于 2025-3-27 14:11:03
http://reply.papertrans.cn/17/1605/160462/160462_35.png
不理会
发表于 2025-3-27 21:14:10
http://reply.papertrans.cn/17/1605/160462/160462_36.png
Disk199
发表于 2025-3-28 01:19:51
Theodore P. Hill,Ulrich Krengel algorithms for ... which is the problem to satisfy as many conjunctions, each of size at most ., as possible. As observed by Trevisan, this leads to approximation algorithms with the same approximation ratio for the more general problem ..., where instead of conjunctions arbitrary .-ary constraints
chance
发表于 2025-3-28 03:50:15
http://reply.papertrans.cn/17/1605/160462/160462_38.png
玷污
发表于 2025-3-28 06:55:31
http://reply.papertrans.cn/17/1605/160462/160462_39.png
Cholecystokinin
发表于 2025-3-28 13:42:03
http://reply.papertrans.cn/17/1605/160462/160462_40.png