Complezity and Approzimation of Satisfactory Partition Problems
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighbors in its part as in the other part. This problem was introduced by Gerber and Kobler in 1998 and further studied by other authors but its complexity remained open until now. We prove in this paper that Satisfactory Partition, as well as a variant where the parts are required to be of the same cardinality, are NPcomplete. We also study approximation results for the latter problem, showing that it has no polynomialtime approximation scheme, whereas a constant approximation can be obtained in polynomial time. Similar results hold for balanced partitions where each vertex is required to have at most as many neighbors in its part as in the other part.
Cristina Bazgan Zsolt Tuza Daniel Vanderpooten
LAMSADE, Universite Paris-Dauphine, Prance Computer and Automation Institute, Hungarian Academy of Sciences, Budapest and Department of Compute
国际会议
The 11th Annual International Computing and Combinatorics Conference COCOON 2005(第11届国际计算和组合会议)
昆明
英文
829-838
2005-08-01（万方平台首次上网日期，不代表论文的发表时间）