论文标题
协变量的算法和复杂性良好平衡
Algorithms and Complexity for Variants of Covariates Fine Balance
论文作者
论文摘要
我们在这里研究了协变量的几个变体，在其中概括了其中一些问题并引入了许多其他问题。我们在这里介绍了提供多项式时间算法或NP硬度证明的协变量问题的全面复杂性研究。描述的多项式时间算法主要是组合，并且依赖于网络流动技术。此外，我们为问题介绍了几个固定参数的可处理结果，即协变量数量和每个协变量的水平数量被视为参数。
We study here several variants of the covariates fine balance problem where we generalize some of these problems and introduce a number of others. We present here a comprehensive complexity study of the covariates problems providing polynomial time algorithms, or a proof of NP-hardness. The polynomial time algorithms described are mostly combinatorial and rely on network flow techniques. In addition we present several fixed-parameter tractable results for problems where the number of covariates and the number of levels of each covariate are seen as a parameter.
