吹气
发表于 2025-3-23 09:43:27
http://reply.papertrans.cn/16/1532/153111/153111_11.png
TRAWL
发表于 2025-3-23 15:58:33
Tracking Pathsfollowing related problem: Given a graph ., two vertices . and ., and a set of forbidden vertices ., find a minimum-cardinality set of trackers ., such that a shortest path . from . to . passes through a forbidden vertex if and only if it passes through a vertex of .. We present a polynomial-time (exact) algorithm for this problem.
SLAG
发表于 2025-3-23 19:13:08
Almost Optimal Cover-Free Families lower order multiplicative terms, . . . .. In fact, our construction time is almost linear in the size of the family. Before our work, such a result existed only for ., and ...As a sample application, we improve the running times of parameterized algorithms from the recent work of Gabizon, Lokshtanov and Pilipczuk [.].
lacrimal-gland
发表于 2025-3-24 00:46:04
http://reply.papertrans.cn/16/1532/153111/153111_14.png
machination
发表于 2025-3-24 05:20:42
http://reply.papertrans.cn/16/1532/153111/153111_15.png
笨拙的我
发表于 2025-3-24 07:57:36
http://reply.papertrans.cn/16/1532/153111/153111_16.png
blight
发表于 2025-3-24 12:52:29
http://reply.papertrans.cn/16/1532/153111/153111_17.png
ELUC
发表于 2025-3-24 16:33:58
http://reply.papertrans.cn/16/1532/153111/153111_18.png
极大的痛苦
发表于 2025-3-24 20:28:29
Scheduling Maintenance Jobs in Networks solutions..Interestingly, the preemptive and the non-preemptive problem can be solved efficiently on paths, whereas we show that mixing both leads to a weakly NP-hard problem that allows for a simple 2-approximation.
KEGEL
发表于 2025-3-25 02:46:29
http://reply.papertrans.cn/16/1532/153111/153111_20.png