退潮
发表于 2025-3-25 06:11:41
http://reply.papertrans.cn/23/2299/229875/229875_21.png
脱离
发表于 2025-3-25 08:23:22
http://reply.papertrans.cn/23/2299/229875/229875_22.png
POINT
发表于 2025-3-25 15:13:12
The 1-Neighbour Knapsack Problem,can be selected only if at least one of its neighbours is also selected. We give approximation algorithms and hardness results when the nodes have both uniform and arbitrary weight and profit functions, and when the dependency graph is directed and undirected.
无辜
发表于 2025-3-25 18:03:00
Quasi-Cyclic Codes over ,,to . = 9. In this paper, linear codes over . are constructed for . up to 6. The codes constructed are from the class of quasi-cyclic codes. In addition, the minimum distance of the extended quadratic residue code of length 44 is determined.
六边形
发表于 2025-3-25 23:19:37
http://reply.papertrans.cn/23/2299/229875/229875_25.png
Limerick
发表于 2025-3-26 00:09:22
978-3-642-25010-1Springer-Verlag GmbH Berlin Heidelberg 2011
不溶解
发表于 2025-3-26 05:00:28
Costas S. Iliopoulos,William F. SmythUp-to-date results.Fast track conference proceedings.State-of-the-art report
新手
发表于 2025-3-26 08:36:17
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229875.jpg
同步左右
发表于 2025-3-26 14:16:19
http://reply.papertrans.cn/23/2299/229875/229875_29.png
人造
发表于 2025-3-26 19:15:26
https://doi.org/10.1007/978-3-030-63223-6ithms and complexity. A . of a graph . is an assignment of colors to the vertices of . such that it is a proper coloring and every vertex dominates all the vertices of at least one color class. The minimum number of colors required for a dominator coloring of . is called the . of . and is denoted by