论文信息 - Separation Problem for k-parashuties

Separation Problem for k-parashuties

This article continues the work [16] in which polyhedral setting of graph approximation problem is provided, support inequalities to polytope are built. In this work NP-hard of the separation problem of k-parachutes relative to M-graph polytope is proved.

Inna Urazova | Ruslan Simanchev | R. Simanchev | I. Urazova

[1] F. Harary. On the notion of balance of a signed graph. , 1953 .

[2] Martin Grötschel,et al. Solution of large-scale symmetric travelling salesman problems , 1991, Math. Program..

[3] Mirko Krivánek,et al. NP-hard problems in hierarchical-tree clustering , 1986, Acta Informatica.

[4] Venkatesan Guruswami,et al. Clustering with qualitative information , 2005, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[5] R. Yu. Simanchev,et al. On the polytope faces of the graph approximation problem , 2015 .

[6] Roded Sharan,et al. Cluster Graph Modification Problems , 2002, WG.

[7] Venkatesan Guruswami,et al. Correlation clustering with a fixed number of clusters , 2005, SODA '06.

[8] David P. Williamson,et al. Deterministic pivoting algorithms for constrained ranking and clustering problems , 2007, SODA '07.

[9] J. Zahn. Approximating Symmetric Relations by Equivalence Relations , 1964 .

[10] A. Schrijver. A Course in Combinatorial Optimization , 1990 .

[11] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[12] A. Ageev,et al. Computational complexity of the graph approximation problem , 2007 .

[13] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[14] Avrim Blum,et al. Correlation Clustering , 2004, Machine Learning.

[15] Zohar Yakhini,et al. Clustering gene expression patterns , 1999, J. Comput. Biol..