頂点被覆 (Japanese Wikipedia)

Analysis of information sources in references of the Wikipedia article "頂点被覆" in Japanese language version.

refsWebsite

Global rank Japanese rank

2^nd place

6^th place

1,185^th place

2,667^th place

274^th place

596^th place

low place

3,903^rd place

low place

acm.org

Garey, M. R.; Johnson, D. S.; Stockmeyer, L. (1974), “Some simplified NP-complete problems”, Proceedings of the sixth annual ACM symposium on Theory of computing, pp. 47–63

Garey, M. R.; D. S. Johnson (1977). “The rectilinear Steiner tree problem is NP-complete”. SIAM Journal on Applied Mathematics 32 (4): 826–834. doi:10.1137/0132071.
Khot, S.; Regev, O. (2008), “Vertex cover might be hard to approximate to within 2-ε”, J. Comput. Syst. Sci. 74 (3): 335–349, doi:10.1016/j.jcss.2007.06.019 .

I. Dinur and S. Safra. On the Hardness of Approximating Minimum Vertex-Cover. Annals of Mathematics, 162(1):439-485, 2005. (Preliminary version in STOC 2002, titled "On the Importance of Being Biased").