inventory
发表于 2025-3-28 16:33:16
https://doi.org/10.1007/978-3-658-06259-0 no .-time algorithm even in sparse graphs . To circumvent this lower bound we aim for algorithms with running time . where . is a parameter and . is a function as small as possible. We investigate which parameters allow for such running times. To this end, we systematica
Lymphocyte
发表于 2025-3-28 21:58:08
http://reply.papertrans.cn/16/1532/153114/153114_42.png
intention
发表于 2025-3-28 22:54:04
Der Klimawandel-Diskurs in China positive weights expressing the capacity of a given agent to contribute to a given project. The realization of a project produces some reward that has to be allocated to the agents. The reward of a realized project is fully allocated to its contributors, according to a simple proportional rule. Exi
搏斗
发表于 2025-3-29 03:15:51
http://reply.papertrans.cn/16/1532/153114/153114_44.png
使隔离
发表于 2025-3-29 07:38:34
https://doi.org/10.1007/978-3-662-37024-7. in . at least one edge is weak. In this work, we study the following generalizations of . with . different strong edge colors. In . an induced . may receive two strong labels as long as they are different. In . and . we may additionally restrict the set of permitted colors for each edge of .. We s
策略
发表于 2025-3-29 14:57:15
http://reply.papertrans.cn/16/1532/153114/153114_46.png
带子
发表于 2025-3-29 18:43:32
https://doi.org/10.1007/978-3-662-37022-3 . independent set) . with . (resp. .). Possibly contradicting intuition, these problems tend to be .-complete, even in graph classes where the classical problem can be solved efficiently. Yet, we exhibit some graph classes where the extension variant remains polynomial-time solvable. We also study
DEFER
发表于 2025-3-29 20:26:04
http://reply.papertrans.cn/16/1532/153114/153114_48.png
条约
发表于 2025-3-30 03:51:53
https://doi.org/10.1007/978-3-662-38159-5n as a sequence of pickup and delivery stops, there exist polynomial time algorithms to find a schedule respecting these constraints, provided that there exists one. However, if no feasible schedule exists, the natural question is to find a schedule minimising constraint violations. We model a gener
Germinate
发表于 2025-3-30 06:07:15
http://reply.papertrans.cn/16/1532/153114/153114_50.png