征税 发表于 2025-3-28 15:02:41
http://reply.papertrans.cn/23/2299/229879/229879_41.pngOverstate 发表于 2025-3-28 19:37:48
http://reply.papertrans.cn/23/2299/229879/229879_42.png愚笨 发表于 2025-3-29 00:24:12
Minsum ,-Sink Problem on Dynamic Flow Path Networks,k, and consider the problem of locating a set of . sinks on a dynamic flow path network with . vertices, where people are located, that minimizes the sum of the evacuation times of all evacuees. Our minsum model is more difficult to deal with than the minmax model, because the cost function is not mseroma 发表于 2025-3-29 06:39:24
Fully Leafed Induced Subtrees, We study the associated optimization problem, that consists in computing the maximal number of leaves, denoted by ., realized by an induced subtree with . vertices, for .. We begin by proving that the . problem is NP-complete in general. Then, we describe a nontrivial branch and bound algorithm thaJogging 发表于 2025-3-29 08:04:42
http://reply.papertrans.cn/23/2299/229879/229879_45.pngDEMN 发表于 2025-3-29 11:24:51
Approximation Algorithms for the ,-Hub Center Routing Problem in Parameterized Metric Graphs,, the . .-. problem is to find a spanning subgraph . of . such that (i) any pair of vertices in . is adjacent in . where . and .; (ii) any pair of vertices in . is not adjacent in .; (iii) each . is adjacent to exactly one vertex in .; and (iv) the routing cost . is minimized where . and . are the vAPRON 发表于 2025-3-29 16:08:20
http://reply.papertrans.cn/23/2299/229879/229879_47.pngInfusion 发表于 2025-3-29 20:07:57
http://reply.papertrans.cn/23/2299/229879/229879_48.png折磨 发表于 2025-3-30 00:13:21
On the Expected Number of Distinct Gapped Palindromic Factors,stimate of the expected number of distinct palindromic factors in a random word for a memoryless source, where each letter is generated independently from the other, according to some fixed probability distribution on the alphabet.细微差别 发表于 2025-3-30 07:06:09
http://reply.papertrans.cn/23/2299/229879/229879_50.png