Ostrich
发表于 2025-3-25 05:02:44
Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs following problems: (i) hitting hyper-rectangles by points in .; (ii) stabbing connected objects by axis-parallel hyperplanes in .; and (iii) hitting half-planes by points. For both the covering and hitting set versions, we obtain incremental polynomial-time algorithms, provided that the dimension . is fixed.
确定无疑
发表于 2025-3-25 10:53:21
http://reply.papertrans.cn/16/1531/153052/153052_22.png
conifer
发表于 2025-3-25 14:25:07
https://doi.org/10.1007/978-3-642-91741-7 With the same running time, the algorithm can be generalized in two directions. The algoritm is a counting algorithm, and the same ideas can be used to count other objects. For example, one can count the number of independent sets of all possible sizes simultaneously with the same running time. The
反感
发表于 2025-3-25 17:09:07
http://reply.papertrans.cn/16/1531/153052/153052_24.png
爱花花儿愤怒
发表于 2025-3-25 22:01:26
https://doi.org/10.1007/978-3-642-91741-7are adjacent and |.(.) − .(.)| ≥ 1 if . and . are at distance 2, for all . and . in .(.). A .-.(2,1)-labeling is an .(2,1)-labeling .:.(.)→{0,...,.}, and the .(2,1)-labeling problem asks the minimum ., which we denote by .(.), among all possible assignments. It is known that this problem is NP-hard
防御
发表于 2025-3-26 02:20:12
http://reply.papertrans.cn/16/1531/153052/153052_26.png
Crepitus
发表于 2025-3-26 05:26:57
http://reply.papertrans.cn/16/1531/153052/153052_27.png
古老
发表于 2025-3-26 09:51:04
Betriebswirtschaftliche Beiträge., . ≤ . ≤ .} where . has at most . nonzeroes per row, we give a .-approximation algorithm. (We assume ., ., ., . are nonnegative.) For any . ≥ 2 and .> 0, if . ≠ . this ratio cannot be improved to . − 1 − ., and under the unique games conjecture this ratio cannot be improved to . − .. One key idea
refine
发表于 2025-3-26 15:52:10
http://reply.papertrans.cn/16/1531/153052/153052_29.png
谈判
发表于 2025-3-26 20:33:09
http://reply.papertrans.cn/16/1531/153052/153052_30.png