ETCH
发表于 2025-3-25 04:36:06
On the Parameterized Complexity of Minus Domination parameterized by twin-cover number, neighborhood diversity or the combined parameters component vertex deletion set and size of the largest component. In addition, we give an .-algorithm when parameterized by distance to cluster number.
辩论
发表于 2025-3-25 09:29:42
http://reply.papertrans.cn/87/8603/860232/860232_22.png
毕业典礼
发表于 2025-3-25 12:12:20
http://reply.papertrans.cn/87/8603/860232/860232_23.png
厌恶
发表于 2025-3-25 17:08:31
Relaxed Agreement Foreststies, i.e., phylogenetic trees with the same set of leaf labels . but with distinct topologies. It is natural to wish to quantify the difference between two such trees . and .. We introduce the problem of computing a . (.) and use this as a proxy for the dissimilarity of . and ., which in this artic
PLUMP
发表于 2025-3-25 23:48:15
On the Computational Complexity of Generalized Common Shape Puzzleses. The first puzzle asks us to form the same shape using polyominoes in . and .. We demonstrate that this is polynomial-time solvable if . and . have constant numbers of polyominoes, and it is strongly NP-complete in general. The second puzzle allows us to make copies of the pieces in . and .. That
奖牌
发表于 2025-3-26 00:16:06
Fractional Bamboo Trimming and Distributed Windows Schedulingroblem, we are given . bamboos with different growth rates and cut fractions. At the end of each day, we can cut a fraction of one bamboo. The goal is to design a perpetual schedule of cuts to minimize the height of the tallest bamboo ever. For this problem, we present a 2-approximation algorithm. I
委托
发表于 2025-3-26 06:56:35
New Support Size Bounds and Proximity Bounds for Integer Linear Programmingone of two main approaches. The first one is to prove a small upper bound on the support size of the ILP, which is the number of variables taking non-zero values in an optimal solution, and then to only search for ILP solutions of small support. The second one is to apply an augmentation algorithm u
Pudendal-Nerve
发表于 2025-3-26 09:55:01
On the Parameterized Complexity of Minus Dominationhere .. We study a generalization of . called . (in short, .) where .. Such a function is said to be a . if for each vertex ., we have .. The objective is to minimize the weight of a minus domination function, which is .. The problem is .-hard even on bipartite, planar, and chordal graphs..In this p
panorama
发表于 2025-3-26 16:23:43
http://reply.papertrans.cn/87/8603/860232/860232_29.png
irreparable
发表于 2025-3-26 19:06:04
Parameterized Algorithms for Covering by Arithmetic Progressionsf two problems related to arithmetic progressions, called . (.) and . (.). In both problems, we are given a set . consisting of . integers along with an integer ., and our goal is to find . arithmetic progressions whose union is .. In . we additionally require the arithmetic progressions to be disjo