DNR215
发表于 2025-3-23 12:28:28
Replica Placement on Bounded Treewidth Graphs,ount of request a replica can serve. The problem falls under the general framework of capacitated set cover. It admits an .-approximation and it is NP-hard to approximate within a factor of .. We study the problem in terms of the treewidth . of the graph and present an .(.)-approximation algorithm.
Yourself
发表于 2025-3-23 14:50:30
,The I/O Complexity of Strassen’s Matrix Multiplication with Recomputation,orial properties of the Strassen computational directed acyclic graph (CDAG). Applications to parallel computation are also developed. The result generalizes a similar bound previously obtained under the constraint of no-recomputation, that is, that intermediate results cannot be computed more than once.
新字
发表于 2025-3-23 21:14:55
http://reply.papertrans.cn/16/1532/153160/153160_13.png
Cougar
发表于 2025-3-24 01:57:24
http://reply.papertrans.cn/16/1532/153160/153160_14.png
crutch
发表于 2025-3-24 05:11:17
http://reply.papertrans.cn/16/1532/153160/153160_15.png
Blemish
发表于 2025-3-24 07:02:33
http://reply.papertrans.cn/16/1532/153160/153160_16.png
Carcinoma
发表于 2025-3-24 13:38:56
http://reply.papertrans.cn/16/1532/153160/153160_17.png
阻挡
发表于 2025-3-24 16:51:42
http://reply.papertrans.cn/16/1532/153160/153160_18.png
反应
发表于 2025-3-24 20:36:43
http://reply.papertrans.cn/16/1532/153160/153160_19.png
Sputum
发表于 2025-3-25 02:43:49
http://reply.papertrans.cn/16/1532/153160/153160_20.png