Problema del círculo mínimo (Spanish Wikipedia)

Analysis of information sources in references of the Wikipedia article "Problema del círculo mínimo" in Spanish language version.

refsWebsite

Global rank Spanish rank

15doi.org

2^nd place

1ams.org

451^st place

1,294^th place

1ethz.ch

2,224^th place

3,176^th place

1jstor.org

26^th place

56^th place

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, MR 721011, doi:10.1137/0212052 ..

doi.org

dx.doi.org

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, MR 721011, doi:10.1137/0212052 ..
Welzl, Emo (1991), «Smallest enclosing disks (balls and ellipsoids)», en Maurer, H., ed., New Results and New Trends in Computer Science, Lecture Notes in Computer Science 555, Springer-Verlag, pp. 359-370, doi:10.1007/BFb0038202 ..
Matoušek, Jiří; Sharir, Micha; Welzl, Emo (1996), «A subexponential bound for linear programming», Algorithmica 16: 498-516, doi:10.1007/BF01940877 ..
Chakraborty, R. K.; Chaudhuri, P. K. (1981), «Note on geometrical solutions for some minimax location problems», Transportation Science 15: 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: 379-394, doi:10.1287/trsc.6.4.379 ..
Drezner, Z.; Shelah, S. (1987), «On the complexity of the Elzinga–Hearn algorithm for the 1-center problem», Mathematics of Operations Research 12 (2): 255-261, JSTOR 3689688, doi:10.1287/moor.12.2.255 ..
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: 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: 321-336, doi:10.1287/trsc.10.4.321 ..
Lawson, C. L. (1965), «The smallest covering cone or sphere», Sociedad de Matemáticas Aplicadas e Industriales 7 (3): 415-417, doi:10.1137/1007084 ..
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 ..
Megiddo, N. (1983), «The weighted Euclidean 1-center problem», Mathematics of Operations Research 8: 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: 358-368, doi:10.1016/0196-6774(86)90027-1 ..

ethz.ch

inf.ethz.ch

Matoušek, Jiří; Sharir, Micha; Welzl, Emo (1996), «A subexponential bound for linear programming», Algorithmica 16: 498-516, doi:10.1007/BF01940877 ..

jstor.org

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