找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: WALCOM: Algorithms and Computation; 18th International C Ryuhei Uehara,Katsuhisa Yamanaka,Hsu-Chun Yen Conference proceedings 2024 The Edit

[复制链接]
发表于 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.
发表于 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[1]-hard with respect to solution size plus feedback vertex number.
发表于 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[1]-hard with respect to solution size plus feedback vertex number.
发表于 2025-3-29 04:41:06 | 显示全部楼层
发表于 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.
发表于 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 | 显示全部楼层
发表于 2025-3-30 05:58:32 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-14 08:06
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表