This paper is aimed to investigate some computational aspects of different isoperimetric problems on weighted trees. In this regard, we consider different connectivity parameters called { \it minimum normalized cuts}/{ \it isoperimteric numbers} defined through taking minimum of the maximum or the mean of the normalized outgoing flows from a set of subdomains of vertices, where these subdomains constitute a { \it partition}/{ \it subpartition}. Following the main result of [A. Daneshgar, { \it et. al.}, { \it On the isoperimetric spectrum of graphs and its approximations}, JCTB, (2010)], it is known that the isoperimetric number and the minimum normalized cut both can be described as $\{0,1\}$ -optimization programs, where the latter one does { \it not} admit a relaxation to the reals. We show that the decision problem for the case of taking $k$ -partitions and the maximum (called the max normalized cut problem { \rm NCP} $^M$ ) as well as the other two decision problems for the mean version (referred to as { \rm IPP} $^m$ and { \rm NCP} $^m$ ) are $NP$ -complete problems. On the other hand, we show that the decision problem for the case of taking $k$ -subpartitions and the maximum (called the max isoperimetric problem { \rm IPP} $^M$ ) can be solved in { \it linear time} for any weighted tree and any $k \geq 2$ . Based on this fact, we provide polynomial time $O(k)$ - approximation algorithms for all different versions of $k$ th isoperimetric numbers considered. Moreover, when the number of partitions/subpartitions, $k$ , is a fixed constant, as an extension of a result of B. Mohar (1989) for the case $k=2$ (usually referred to as the Cheeger constant), we prove that max and mean isoperimetric numbers of weighted trees as well as their max normalized cut can be computed in polynomial time . We also prove some hardness results for the case of simple unweighted graphs and trees.
英文摘要:
This paper is aimed to investigate some computational aspects of different isoperimetric problems on weighted trees. In this regard, we consider different connectivity parameters called {\it minimum normalized cuts}/{\it isoperimteric numbers} defined through taking minimum of the maximum or the mean of the normalized outgoing flows from a set of subdomains of vertices, where these subdomains constitute a {\it partition}/{\it subpartition}. Following the main result of [A. Daneshgar, {\it et. al.}, {\it On the isoperimetric spectrum of graphs and its approximations}, JCTB, (2010)], it is known that the isoperimetric number and the minimum normalized cut both can be described as $\{0,1\}$-optimization programs, where the latter one does {\it not} admit a relaxation to the reals. We show that the decision problem for the case of taking $k$-partitions and the maximum (called the max normalized cut problem {\rm NCP}$^M$) as well as the other two decision problems for the mean version (referred to as {\rm IPP}$^m$ and {\rm NCP}$^m$) are $NP$-complete problems. On the other hand, we show that the decision problem for the case of taking $k$-subpartitions and the maximum (called the max isoperimetric problem {\rm IPP}$^M$) can be solved in {\it linear time} for any weighted tree and any $k \geq 2$. Based on this fact, we provide polynomial time $O(k)$-approximation algorithms for all different versions of $k$th isoperimetric numbers considered.
Moreover, when the number of partitions/subpartitions, $k$, is a fixed constant, as an extension of a result of B. Mohar (1989) for the case $k=2$ (usually referred to as the Cheeger constant), we prove that max and mean isoperimetric numbers of weighted trees as well as their max normalized cut can be computed in polynomial time. We also prove some hardness results for the case of simple unweighted graphs and trees.
Decision Tree Complexity versus Block Sensitivity and Degree
Relations between the decision tree complexity and various other complexity measures of Boolean functions is a thriving topic of research in computational complexity . It is known that decision tree complexity is bounded above by the cube of block sensitivity, and the cube of polynomial degree. However, the widest separation between decision tree complexity and each of block sensitivity and degree that is witnessed by known Boolean functions is quadratic. In this work, we investigate the tightness of the existing cubic upper bounds. We improve the cubic upper bounds for many interesting classe…
On the Complexity of Role Colouring Planar Graphs, Trees and Cographs
我们证明了几个结果的复杂性的角色着色问题。图$G$的角色着色是对图$G$的顶点的颜色分配,使得相同颜色的两个顶点在它们的邻域中具有相同的颜色集合。我们发现,问题找到一个角色着色与$1< k <n$颜色是NP-困难的平面图。我们表明,限制问题的树产生多项式可解的情况下,只要$k$是恒定的或有一个恒定的差异与$n$,在树中的顶点数。最后证明了上图总是$1<k\leq n$的$k$ -角色着色,并在多项式时间内构造了这样的着色.
本文考虑的任务,学习用户的偏好的一组组合的替代品,通常使用的在线配置,例如。在许多情况下,只有一组在过去的互动中选择的替代品可供学习者使用。Fargier et al. [2018]提出了一种方法来学习,在这样的设置中,用户的偏好模型,将先前选择的替代方案排名尽可能高;以及一种算法来学习,在这种设置中,一种特定的偏好模型:词典偏好树(LP树)。在本文中,我们研究的复杂性理论问题,这种方法。我们给出了学习LP树的样本复杂度的上界,它是对数的属性数。我们还证明了计算LP树,最大限度地减少经验风险时,可以在多项式时间限制的线性LP树类。
Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results
Laboratoire de Recherche en Informatique, CNRS & Université Paris-Sud(法国国家科学研究中心与巴黎南大学计算机研究实验室);Institute for Information Transmission Problems & MIPT(信息传输问题研究所与莫斯科物理技术学院);Steklov Mathematical Institute & National Research University Higher School of Economics(斯捷克洛夫数学研究所与高等经济大学)