Axillary
发表于 2025-3-28 18:20:01
,Simultaneous Drawing of Layered Trees, describe a dynamic program running in polynomial time for the restricted case of two trees. If there are more than two trees, we restrict the number of layers to three, which allows for a reduction to a shortest-path problem. This way, we achieve XP-time in the number of trees.
Orgasm
发表于 2025-3-28 20:40:35
,The Parameterized Complexity of Terminal Monitoring Set,od diversity, and feedback edge number. For the weighted version of the problem, we obtain a FPT algorithm with respect to vertex cover number, and for a relaxed version of the problem, we show that it is W-hard with respect to solution size plus feedback vertex number.
Digest
发表于 2025-3-29 01:06:34
,The Parameterized Complexity of Terminal Monitoring Set,od diversity, and feedback edge number. For the weighted version of the problem, we obtain a FPT algorithm with respect to vertex cover number, and for a relaxed version of the problem, we show that it is W-hard with respect to solution size plus feedback vertex number.
载货清单
发表于 2025-3-29 04:41:06
http://reply.papertrans.cn/103/10201/1020038/1020038_44.png
custody
发表于 2025-3-29 07:14:48
,On the Hardness of Gray Code Problems for Combinatorial Objects,ar type)? For example, 000, 001, 010, 100 is a no instance of the first question, while 1234, 1324, 1243 is a yes instance of the second question due to the order .. We prove that a variety of Gray coding problems are NP-complete using a new tool we call a ..
换话题
发表于 2025-3-29 11:30:31
,Improved Approximation Algorithms for Cycle and Path Packings,ic .-path packing, we improve the approximation ratio from . to . for even .. For the case of ., we improve the approximation ratio from 3/4 to 5/6 for metric 4-cycle packing, from 2/3 to 3/4 for general 4-cycle packing, and from 3/4 to 14/17 for metric 4-path packing.
摊位
发表于 2025-3-29 18:04:24
,Improved Approximation Algorithms for Cycle and Path Packings,ic .-path packing, we improve the approximation ratio from . to . for even .. For the case of ., we improve the approximation ratio from 3/4 to 5/6 for metric 4-cycle packing, from 2/3 to 3/4 for general 4-cycle packing, and from 3/4 to 14/17 for metric 4-path packing.
nominal
发表于 2025-3-29 21:03:46
,Reasons to Fall (More) in Love with Combinatorial Reconfiguration,tage for a more in-depth investigation. The talk is not intended to be a comprehensive survey of the field, but instead a personal and idiosyncratic tour, full of suggestions for future directions of research.
文艺
发表于 2025-3-30 01:37:31
http://reply.papertrans.cn/103/10201/1020038/1020038_49.png
Fretful
发表于 2025-3-30 05:58:32
http://reply.papertrans.cn/103/10201/1020038/1020038_50.png