Self-Help-Group
发表于 2025-3-23 12:25:38
http://reply.papertrans.cn/59/5887/588633/588633_11.png
adjacent
发表于 2025-3-23 15:07:29
http://reply.papertrans.cn/59/5887/588633/588633_12.png
gene-therapy
发表于 2025-3-23 21:59:52
http://reply.papertrans.cn/59/5887/588633/588633_13.png
泥沼
发表于 2025-3-24 01:12:07
http://reply.papertrans.cn/59/5887/588633/588633_14.png
故意
发表于 2025-3-24 05:56:02
John H. Riskind,Neil A. Rectornumber of vertices) . of the representing islands. We study the problem of representability of an input graph . by islands of size at most .. We conjecture that this problem is NP-complete for any positive integer ., and prove the conjecture for . < 3 and . > 5; the cases . = 3, 4, 5 remain open.
故意钓到白杨
发表于 2025-3-24 09:31:36
http://reply.papertrans.cn/59/5887/588633/588633_16.png
Matrimony
发表于 2025-3-24 11:43:42
http://reply.papertrans.cn/59/5887/588633/588633_17.png
修改
发表于 2025-3-24 16:25:01
Stephanie E. Cassin,Neil A. Rector,John H. Riskind from . to ., and one demand for transfer from . to ., not necessarily in this order. We show that maximizing the number of satisfied users is NP-hard, and even APX-hard, even if all the transfers take exactly the same (non-zero) time. On the other hand, if all the transfers are instantaneous, the p
IDEAS
发表于 2025-3-24 20:06:13
http://reply.papertrans.cn/59/5887/588633/588633_19.png
切割
发表于 2025-3-25 02:51:22
http://reply.papertrans.cn/59/5887/588633/588633_20.png