自负的人
发表于 2025-3-23 13:00:39
On the ,(,,,)-Labeling of Co-comparability Graphs, at least . apart, while vertices at distance at most 2 receive labels at least . apart. The goal of the .(.,.)-labeling problem is to produce a legal labeling that minimizes the largest label used. Since the decision version of the .(.,.)-labeling problem is NP-complete, it is important to investig
Cupping
发表于 2025-3-23 17:30:44
http://reply.papertrans.cn/24/2301/230059/230059_12.png
consolidate
发表于 2025-3-23 20:20:53
Extending the Hardness of RNA Secondary Structure Comparison,olecule folding and identification of a function common to a set of molecules. Lin . proposed to define a similarity criterion between RNA structures using a concept of edit distance ; they named the corresponding problem .. Recently, Blin . showed that another problem, the . problem (or .),
Observe
发表于 2025-3-23 22:28:15
http://reply.papertrans.cn/24/2301/230059/230059_14.png
arsenal
发表于 2025-3-24 04:54:02
http://reply.papertrans.cn/24/2301/230059/230059_15.png
Jogging
发表于 2025-3-24 09:00:40
http://reply.papertrans.cn/24/2301/230059/230059_16.png
optional
发表于 2025-3-24 12:19:17
Constrained Cycle Covers in Halin Graphs,cted) vertex is in at least one cycle. This problem arises in the design fiber-optic telecommunication networks which employ a set of rings covering the network. Besides two types of minimum weight cycle cover problem, we also settle the problem of covering Halin graphs with an optimal 2-edge-connec
Fermentation
发表于 2025-3-24 16:56:33
http://reply.papertrans.cn/24/2301/230059/230059_18.png
exostosis
发表于 2025-3-24 19:36:52
A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection,, such that the number of bins used plus the sum of rejection costs of unpacked items is minimized. In this paper, we first show that bin packing with rejection can be reduced to . multiple knapsack problems. Then, based on techniques for the multiple knapsack problem we give a fast asymptotic polyn
险代理人
发表于 2025-3-25 00:49:52
https://doi.org/10.1007/978-981-19-2277-0is always packed into the first bin where it fits. For an instance . let .(.) and .(.) denote the number of the used bins by algorithm FFD, and an optimal algorithm, respectively. We show in this paper that .and that this bound is tight. The tight bound of the additive constant was an open question