Smallest-circle problem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Smallest-circle problem" in English language version.

refsWebsite

Global rank English rank

17doi.org

2^nd place

3semanticscholar.org

11^th place

8^th place

2psu.edu

207^th place

136^th place

1ams.org

451^st place

277^th place

1ethz.ch

2,224^th place

1,900^th place

1jstor.org

26^th place

20^th place

1arxiv.org

69^th place

59^th place

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Megiddo, Nimrod (1983), "Linear-time algorithms for linear programming in $R 3$ and related problems", SIAM Journal on Computing, 12 (4): 759–776, doi:10.1137/0212052, MR 0721011, S2CID 14467740.

arxiv.org (Global: 69^th place; English: 59^th place)

Arnaudon, Marc; Nielsen, Frank (2013), "On approximating the Riemannian 1-center", Computational Geometry, 46 (1): 93–104, arXiv:1101.4718, doi:10.1016/j.comgeo.2012.04.007

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

Elzinga, J.; Hearn, D. W. (1972), "The minimum covering sphere problem", Management Science, 19: 96–104, doi:10.1287/mnsc.19.1.96
Megiddo, Nimrod (1983), "Linear-time algorithms for linear programming in $R 3$ and related problems", SIAM Journal on Computing, 12 (4): 759–776, doi:10.1137/0212052, MR 0721011, S2CID 14467740.
Matoušek, Jiří; Sharir, Micha; Welzl, Emo (1996), "A subexponential bound for linear programming" (PDF), Algorithmica, 16 (4–5): 498–516, CiteSeerX 10.1.1.46.5644, doi:10.1007/BF01940877, S2CID 877032.
Shamos, M. I.; Hoey, D. (1975), "Closest point problems", Proceedings of 16th Annual IEEE Symposium on Foundations of Computer Science, pp. 151–162, doi:10.1109/SFCS.1975.8, S2CID 40615455
Welzl, Emo (1991), "Smallest enclosing disks (balls and ellipsoids)", in Maurer, H. (ed.), New Results and New Trends in Computer Science, Lecture Notes in Computer Science, vol. 555, Springer-Verlag, pp. 359–370, CiteSeerX 10.1.1.46.1450, doi:10.1007/BFb0038202, ISBN 978-3-540-54869-0.
Nielsen, Frank; Nock, Richard (2008), "On the smallest enclosing information disk", Information Processing Letters, 105 (3): 93–97, doi:10.1016/j.ipl.2007.08.007
Chakraborty, R. K.; Chaudhuri, P. K. (1981), "Note on geometrical solutions for some minimax location problems", Transportation Science, 15 (2): 164–166, doi:10.1287/trsc.15.2.164.
Elzinga, J.; Hearn, D. W. (1972), "Geometrical solutions for some minimax location problems", Transportation Science, 6 (4): 379–394, doi:10.1287/trsc.6.4.379.
Drezner, Zvi; Shelah, Saharon (1987), "On the complexity of the Elzinga–Hearn algorithm for the 1-center problem", Mathematics of Operations Research, 12 (2): 255–261, doi:10.1287/moor.12.2.255, JSTOR 3689688.
Hearn, D. W.; Vijay, J.; Nickel, S. (1995), "Codes of geometrical algorithms for the (weighted) minimum circle problem", European Journal of Operational Research, 80: 236–237, doi:10.1016/0377-2217(95)90075-6.
Jacobsen, S. K. (1981), "An algorithm for the minimax Weber problem", European Journal of Operational Research, 6 (2): 144–148, doi:10.1016/0377-2217(81)90200-9.
Hearn, D. W.; Vijay, J. (1982), "Efficient algorithms for the (weighted) minimum circle problem", Operations Research, 30 (4): 777–795, doi:10.1287/opre.30.4.777.
Elzinga, J.; Hearn, D. W.; Randolph, W. D. (1976), "Minimax multifacility location with Euclidean distances", Transportation Science, 10 (4): 321–336, doi:10.1287/trsc.10.4.321.
Lawson, C. L. (1965), "The smallest covering cone or sphere", SIAM Review, 7 (3): 415–417, doi:10.1137/1007084.
Megiddo, N. (1983), "The weighted Euclidean 1-center problem", Mathematics of Operations Research, 8 (4): 498–504, doi:10.1287/moor.8.4.498.
Megiddo, N.; Zemel, E. (1986), "An O(n log n) randomizing algorithm for the weighted Euclidean 1-center problem", Journal of Algorithms, 7 (3): 358–368, doi:10.1016/0196-6774(86)90027-1.
Arnaudon, Marc; Nielsen, Frank (2013), "On approximating the Riemannian 1-center", Computational Geometry, 46 (1): 93–104, arXiv:1101.4718, doi:10.1016/j.comgeo.2012.04.007

ethz.ch (Global: 2,224^th place; English: 1,900^th place)

inf.ethz.ch

Matoušek, Jiří; Sharir, Micha; Welzl, Emo (1996), "A subexponential bound for linear programming" (PDF), Algorithmica, 16 (4–5): 498–516, CiteSeerX 10.1.1.46.5644, doi:10.1007/BF01940877, S2CID 877032.

jstor.org (Global: 26^th place; English: 20^th place)

Drezner, Zvi; Shelah, Saharon (1987), "On the complexity of the Elzinga–Hearn algorithm for the 1-center problem", Mathematics of Operations Research, 12 (2): 255–261, doi:10.1287/moor.12.2.255, JSTOR 3689688.

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Matoušek, Jiří; Sharir, Micha; Welzl, Emo (1996), "A subexponential bound for linear programming" (PDF), Algorithmica, 16 (4–5): 498–516, CiteSeerX 10.1.1.46.5644, doi:10.1007/BF01940877, S2CID 877032.
Welzl, Emo (1991), "Smallest enclosing disks (balls and ellipsoids)", in Maurer, H. (ed.), New Results and New Trends in Computer Science, Lecture Notes in Computer Science, vol. 555, Springer-Verlag, pp. 359–370, CiteSeerX 10.1.1.46.1450, doi:10.1007/BFb0038202, ISBN 978-3-540-54869-0.

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

api.semanticscholar.org

Megiddo, Nimrod (1983), "Linear-time algorithms for linear programming in $R 3$ and related problems", SIAM Journal on Computing, 12 (4): 759–776, doi:10.1137/0212052, MR 0721011, S2CID 14467740.
Matoušek, Jiří; Sharir, Micha; Welzl, Emo (1996), "A subexponential bound for linear programming" (PDF), Algorithmica, 16 (4–5): 498–516, CiteSeerX 10.1.1.46.5644, doi:10.1007/BF01940877, S2CID 877032.
Shamos, M. I.; Hoey, D. (1975), "Closest point problems", Proceedings of 16th Annual IEEE Symposium on Foundations of Computer Science, pp. 151–162, doi:10.1109/SFCS.1975.8, S2CID 40615455

Smallest-circle problem (English Wikipedia)

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

arxiv.org (Global: 69th place; English: 59th place)

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

ethz.ch (Global: 2,224th place; English: 1,900th place)