| 1 |
D. Dobkin, D. Gunopulos, and W. Maass, "Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning," J. Comput. Syst. Sci., vol. 52, no. 3, pp. 453-470, 1996.
DOI
|
| 2 |
J. Eckstein, P. Hammer, Y. Liu, M. Nediak, and B. Simeone, "The maximum box problem and its application to data analysis," Comput. Optim. Appl., vol. 23, no. 3, pp. 285-298, 2002.
DOI
|
| 3 |
B. Aronov and S. Har-Peled, "On approximating the depth and related problems," SIAM J. Comput., vol. 38, no. 3, pp. 899-921, 2008.
DOI
|
| 4 |
J. Bentley, "Programming pearls: algorithm design techniques," Commun. ACM, vol. 27, no. 9, pp. 865-873, 1984.
DOI
|
| 5 |
C. Cortes, J. M. Diaz-Banez, P. Perez-Lantero, C. Seara, J. Urrutia and I. Ventura, "Bichromatic separability with two boxes: A general approach," Journal of Algorithms Cognition, Informatics and Logic, vol. 64, no. 1, pp. 79-88, 2009.
|
| 6 |
J. Barbay, Timothy M. Chan, Gonzalo Navarro, and Pablo Perez-Lantero, "Maximum-weight planar boxes in $} "$O(n^2)$") time (and better)," Information Processing Letters, vol. 114, no. 1, pp. 437-445, 2014.
DOI
|
| 7 |
C. Bautista-Santiago, J. M. Diaz-Banez, D. Lara, P. Perez-Lantero, J. Urrutia, and I. Ventura, "Computing optimal islands," Operational Research Letters, vol. 39, no. 4, pp. 246-251, 2011.
DOI
|
webmaster
