圣歌
发表于 2025-4-1 03:18:34
http://reply.papertrans.cn/16/1532/153153/153153_61.png
Ejaculate
发表于 2025-4-1 06:37:36
http://reply.papertrans.cn/16/1532/153153/153153_62.png
亵渎
发表于 2025-4-1 11:17:24
http://reply.papertrans.cn/16/1532/153153/153153_63.png
NUDGE
发表于 2025-4-1 17:16:11
On the Spanning and Routing Ratios of the Directed ,-Graph,tric graphs, no bound is known on the spanning and routing ratios of the directed .-graph. We show that the directed .-graph of a point set ., denoted ., is a 7-spanner and there exist point sets where the spanning ratio is at least ., for any .. It is known that the standard greedy .-routing algori
流浪者
发表于 2025-4-1 21:15:34
http://reply.papertrans.cn/16/1532/153153/153153_65.png
毗邻
发表于 2025-4-1 23:03:09
http://reply.papertrans.cn/16/1532/153153/153153_66.png
GOAT
发表于 2025-4-2 03:33:42
http://reply.papertrans.cn/16/1532/153153/153153_67.png
Hippocampus
发表于 2025-4-2 10:47:19
Pattern Matching in Doubling Spaces,tant doubling dimension .. More precisely, given an input parameter ., the .-distortion problem is to find a one-to-one mapping from . to . that distorts distances by a factor at most .. We first show by a reduction from .-clique that, in doubling dimension ., this problem is NP-hard and W-hard.