Abstract
We consider the Minimum Independent Set Partition Problem (\(\mathsf {MISP}\)) and its dual (\(\mathsf {MISPDual}\)). The input is a multi-set of N vectors from \(\{0,1\}^n\), where \(U := \{1,\ldots ,n\}\) is the index set. In \(\mathsf {MISP}\), a threshold k is given and the goal is to partition U into a minimum number of subsets such that the projected vectors on each subset of indices have multiplicity at least k, where the multiplicity is the number of times a vector repeats in the (projected) multi-set. In \(\mathsf {MISPDual}\), a target number \(\chi \) is given instead of k, and the goal is to partition U into \(\chi \) subsets to maximize k such that each projected vector appears at least k times.
The problem is inspired from applications in private voting verification. Each of the N vectors corresponds to a voter’s preference for n contests. The n contests are partitioned into \(\chi \) subsets such that each voter receives a verifiable tracking number for each subset. For each subset of contests, each voter’s tracking number together with the votes for that subset is released in some public bulletin, which can be verified by each voter. The multiplicity k of the vectors’ projection onto each subset of indices ensures that the bulletin for each subset of contests satisfies the standard privacy notion of k-anonymity.
In this paper, we show strong inapproximability results for both problems. For \(\mathsf {MISP}\), we show the problem is hard to approximate to within a factor of \(n^{1-\epsilon }\). For \(\mathsf {MISPDual}\), we show the problem is hard to approximate to within a factor of \(N^{1-\epsilon }\). Here, \(\epsilon \) can be any small constant. Note that factors n and N approximation are trivial for \(\mathsf {MISP}\) and \(\mathsf {MISPDual}\) respectively. Hence, our results imply that any polynomial-time algorithm can almost do no better than the trivial one.
This research is partially funded by a grant from Hong Kong RGC under the contract HKU719312E.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of np. J. ACM 45(1), 70–122 (1998)
Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, STOC 1971, pp. 151–158. ACM, New York (1971)
Dailey, D.P.: Uniqueness of colorability and colorability of planar 4-regular graphs are np-complete. Discrete Mathematics 30(3), 289–293 (1980)
Feige, U., Kilian, J.: Zero knowledge and the chromatic number. In: Proceedings of the Eleventh Annual IEEE Conference on Computational Complexity, pp. 278–287 (1996)
Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634–652 (1998)
Ganta, S.R., Kasiviswanathan, S.P., Smith, A.: Composition attacks and auxiliary information in data privacy. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD, pp. 265–273. ACM, New York (2008)
Håstad, J.: Some optimal inapproximability results. J. ACM 48(4), 798–859 (2001)
Johnson, D.S.: Approximation algorithms for combinatorial problems. In: Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, STOC 1973, pp. 38–49. ACM, New York (1973)
Karp, R.M.: Reducibility Among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press (1972)
Onn, S., Schulman, L.J.: The vector partition problem for convex objective functions. Math. Oper. Res. 26(3), 583–590 (2001)
Sweeney, L.: k-anonymity: A model for protecting privacy. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 10(5), 557–570 (2002)
Wagner, D.: Find index set partition that has large projections (2013). http://cstheory.stackexchange.com/questions/17562/find-index-set-partition-that-has-large-projections
Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing 3(6), 103–128 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Chan, TH.H., Papamanthou, C., Zhao, Z. (2015). On the Complexity of the Minimum Independent Set Partition Problem. In: Xu, D., Du, D., Du, D. (eds) Computing and Combinatorics. COCOON 2015. Lecture Notes in Computer Science(), vol 9198. Springer, Cham. https://doi.org/10.1007/978-3-319-21398-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-21398-9_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21397-2
Online ISBN: 978-3-319-21398-9
eBook Packages: Computer ScienceComputer Science (R0)