OGLE
发表于 2025-3-23 13:47:27
http://reply.papertrans.cn/103/10201/1020040/1020040_11.png
absolve
发表于 2025-3-23 16:24:37
http://reply.papertrans.cn/103/10201/1020040/1020040_12.png
谦虚的人
发表于 2025-3-23 19:26:31
http://reply.papertrans.cn/103/10201/1020040/1020040_13.png
Nibble
发表于 2025-3-24 01:42:06
Online Facility Assignment,mers appear anywhere on the line. We describe a greedy algorithm with competitive ratio 4|.| and another one with competitive ratio |.|. Finally, we consider a variant in which the facilities are placed on the vertices of a graph and two algorithms in that setting.
Chivalrous
发表于 2025-3-24 06:09:31
Online Facility Assignment,mers appear anywhere on the line. We describe a greedy algorithm with competitive ratio 4|.| and another one with competitive ratio |.|. Finally, we consider a variant in which the facilities are placed on the vertices of a graph and two algorithms in that setting.
amplitude
发表于 2025-3-24 10:03:49
http://reply.papertrans.cn/103/10201/1020040/1020040_16.png
惹人反感
发表于 2025-3-24 11:50:25
Approximating Partially Bounded Degree Deletion on Directed Graphs,ed within ., and (2) although it becomes NP-hard to approximate PBDD better than . (even on . graphs) once unbounded vertices are allowed, it can be within . when only in-degrees (and none of out-degrees) are partially bounded by ..
KIN
发表于 2025-3-24 15:47:12
http://reply.papertrans.cn/103/10201/1020040/1020040_18.png
Ebct207
发表于 2025-3-24 21:41:21
http://reply.papertrans.cn/103/10201/1020040/1020040_19.png
间谍活动
发表于 2025-3-25 01:34:12
http://reply.papertrans.cn/103/10201/1020040/1020040_20.png