sphincter
发表于 2025-3-23 13:24:49
http://reply.papertrans.cn/23/2299/229878/229878_11.png
讨人喜欢
发表于 2025-3-23 13:52:07
Single Parameter FPT-Algorithms for Non-trivial Games, this paper provides positive results regarding Nash equilibria. We show that consideration of sparse games or limitations of the support result in fixed-parameter algorithms with respect to one parameter only for the .. problem. That is, we show that a sample uniform Nash equilibrium in .-sparse im
atopic
发表于 2025-3-23 18:13:22
The Complexity Status of Problems Related to Sparsest Cuts,(.)/(|.||. ∖ .|). This problem is NP-hard. The proof can be found in . In the case of unit capacities (i. e. if .(.) = 1 for every . ∈ .) the problem is to minimize |.(.,. ∖ .)|/(|.||. ∖ .|) over all subsets . ⊂ .. While this variant of the sparsest cut problem is often assumed to be NP-hard, th
Fraudulent
发表于 2025-3-23 22:23:32
On Approximation Complexity of Metric Dimension Problem,imension problem is not approximable within . for any ., unless ., and we give an approximation algorithm which matches the lower bound. Even for bounded degree instances it is APX-hard to determine (compute) the exact value of the metric dimension which we prove by constructing an approximation pre
支柱
发表于 2025-3-24 02:53:50
http://reply.papertrans.cn/23/2299/229878/229878_15.png
cathartic
发表于 2025-3-24 08:54:20
http://reply.papertrans.cn/23/2299/229878/229878_16.png
大门在汇总
发表于 2025-3-24 14:05:41
Computing Role Assignments of Proper Interval Graphs in Polynomial Time,morphism is also called an .-role assignment of .. Role assignments have applications in distributed computing, social network theory, and topological graph theory. The . problem has as input a pair of graphs (.,.) and asks whether . has an .-role assignment. This problem is .-complete already on in
妨碍
发表于 2025-3-24 16:21:42
http://reply.papertrans.cn/23/2299/229878/229878_18.png
Incommensurate
发表于 2025-3-24 21:19:41
http://reply.papertrans.cn/23/2299/229878/229878_19.png
Flounder
发表于 2025-3-25 01:40:18
http://reply.papertrans.cn/23/2299/229878/229878_20.png