Set packing (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Set packing" in English language version.

Last modified: 18:56:45, 13 August 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

44doi.org

2^nd place

33semanticscholar.org

15^th place

8^th place

22arxiv.org

49^th place

31^st place

11ams.org

434^th place

249^th place

11springer.com

182^nd place

172^nd place

ams.org (Global: 434^th place; English: 249^th place)

mathscinet.ams.org

Hazan, Elad; Safra, Shmuel; Schwartz, Oded (2006), "On the complexity of approximating k-set packing", Computational Complexity, 15 (1): 20–39, doi:10.1007/s00037-006-0205-6, MR 2226068, S2CID 1858087. See in particular p. 21: "Maximum clique (and therefore also maximum independent set and maximum set packing) cannot be approximated to within $O(n^{1-\epsilon })$ unless NP ⊂ ZPP."

arxiv.org (Global: 49^th place; English: 31^st place)

Cygan, Marek (October 2013). "Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. pp. 509–518. arXiv:1304.1424. doi:10.1109/FOCS.2013.61. ISBN 978-0-7695-5135-7. S2CID 14160646.
Neuwohner, Meike (2021). "An improved approximation algorithm for the maximum weight independent set problem in $d$ -claw free graphs". In Bläser, Markus; Monmege, Benjamin (eds.). 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16–19, 2021, Saarbrücken, Germany (Virtual Conference). LIPIcs. Vol. 187. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. pp. 53:1–53:20. arXiv:2106.03545. doi:10.4230/LIPICS.STACS.2021.53.

doi.org (Global: 2^nd place; English: 2^nd place)

Hazan, Elad; Safra, Shmuel; Schwartz, Oded (2006), "On the complexity of approximating k-set packing", Computational Complexity, 15 (1): 20–39, doi:10.1007/s00037-006-0205-6, MR 2226068, S2CID 1858087. See in particular p. 21: "Maximum clique (and therefore also maximum independent set and maximum set packing) cannot be approximated to within $O(n^{1-\epsilon })$ unless NP ⊂ ZPP."
Cygan, Marek (October 2013). "Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. pp. 509–518. arXiv:1304.1424. doi:10.1109/FOCS.2013.61. ISBN 978-0-7695-5135-7. S2CID 14160646.
Fürer, Martin; Yu, Huiwen (2014). "Approximating the $k$ -set packing problem by local improvements". In Fouilhoux, Pierre; Gouveia, Luis Eduardo Neves; Mahjoub, A. Ridha; Paschos, Vangelis T. (eds.). Combinatorial Optimization. Lecture Notes in Computer Science. Vol. 8596. Cham: Springer International Publishing. pp. 408–420. doi:10.1007/978-3-319-09174-7_35. ISBN 978-3-319-09174-7. S2CID 15815885.
Neuwohner, Meike (2021). "An improved approximation algorithm for the maximum weight independent set problem in $d$ -claw free graphs". In Bläser, Markus; Monmege, Benjamin (eds.). 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16–19, 2021, Saarbrücken, Germany (Virtual Conference). LIPIcs. Vol. 187. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. pp. 53:1–53:20. arXiv:2106.03545. doi:10.4230/LIPICS.STACS.2021.53.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Hazan, Elad; Safra, Shmuel; Schwartz, Oded (2006), "On the complexity of approximating k-set packing", Computational Complexity, 15 (1): 20–39, doi:10.1007/s00037-006-0205-6, MR 2226068, S2CID 1858087. See in particular p. 21: "Maximum clique (and therefore also maximum independent set and maximum set packing) cannot be approximated to within $O(n^{1-\epsilon })$ unless NP ⊂ ZPP."
Cygan, Marek (October 2013). "Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. pp. 509–518. arXiv:1304.1424. doi:10.1109/FOCS.2013.61. ISBN 978-0-7695-5135-7. S2CID 14160646.
Fürer, Martin; Yu, Huiwen (2014). "Approximating the $k$ -set packing problem by local improvements". In Fouilhoux, Pierre; Gouveia, Luis Eduardo Neves; Mahjoub, A. Ridha; Paschos, Vangelis T. (eds.). Combinatorial Optimization. Lecture Notes in Computer Science. Vol. 8596. Cham: Springer International Publishing. pp. 408–420. doi:10.1007/978-3-319-09174-7_35. ISBN 978-3-319-09174-7. S2CID 15815885.

springer.com (Global: 182^nd place; English: 172^nd place)

link.springer.com

Fürer, Martin; Yu, Huiwen (2014). "Approximating the $k$ -set packing problem by local improvements". In Fouilhoux, Pierre; Gouveia, Luis Eduardo Neves; Mahjoub, A. Ridha; Paschos, Vangelis T. (eds.). Combinatorial Optimization. Lecture Notes in Computer Science. Vol. 8596. Cham: Springer International Publishing. pp. 408–420. doi:10.1007/978-3-319-09174-7_35. ISBN 978-3-319-09174-7. S2CID 15815885.

Set packing (English Wikipedia)

ams.org (Global: 434th place; English: 249th place)

mathscinet.ams.org

arxiv.org (Global: 49th place; English: 31st place)

doi.org (Global: 2nd place; English: 2nd place)

semanticscholar.org (Global: 15th place; English: 8th place)