overbearing
发表于 2025-3-28 16:15:15
Der Notfall abseits der Routinen the host tree of a subtree representation. We show that the anchor width of a chordal graph is at most . where . denotes the leafage. This shows that for some subclasses computing the neighborhood polynomial is possible in polynomial time while it is .-hard for general chordal graphs.
遗产
发表于 2025-3-28 22:45:49
http://reply.papertrans.cn/16/1532/153153/153153_42.png
BARK
发表于 2025-3-29 00:44:02
Scheduling with Testing on Multiple Identical Parallel Machines,egy and a lower bound which approaches 2. In the case of uniform testing times, we can improve the SBS algorithm to be 3-competitive. For the preemptive case we provide a 2-competitive algorithm and a tight lower bound which approaches the same value.
obnoxious
发表于 2025-3-29 06:07:03
http://reply.papertrans.cn/16/1532/153153/153153_44.png
DAUNT
发表于 2025-3-29 10:08:16
Pattern Matching in Doubling Spaces,lem, which is an optimization version of the .-distortion problem where we allow scaling. For doubling spaces, we prove the same hardness results, and for fixed ., we give a .-approximation algorithm running in time ., where . denotes the minimum distortion between . and ..
exacerbate
发表于 2025-3-29 14:43:25
http://reply.papertrans.cn/16/1532/153153/153153_46.png
Hallowed
发表于 2025-3-29 18:48:09
http://reply.papertrans.cn/16/1532/153153/153153_47.png
弹药
发表于 2025-3-29 21:20:19
http://reply.papertrans.cn/16/1532/153153/153153_48.png
裂口
发表于 2025-3-30 00:08:21
http://reply.papertrans.cn/16/1532/153153/153153_49.png
mercenary
发表于 2025-3-30 07:15:40
http://reply.papertrans.cn/16/1532/153153/153153_50.png