Bichromatic separability with two boxes: A general approach

Journal of Algorithms

Volumn 64, Issue 2-3, 2009, Pages 79-88

  Cortes C ^a   Diaz Banez J M ^a   Perez Lantero P ^b   Seara, C ^c   Urrutia, J ^d   Ventura, I ^a  

^a UNIVERSITY OF SEVILLE   (Spain)

^b Universidad de La   (Cuba)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^d UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

Author keywords

Algorithm design; Bioinformatics; Classification problems; Discrete optimization; Dynamic maintenance; Maximum consecutive subsequence

Indexed keywords

ALGORITHM DESIGN; BENTLEY; CLASSIFICATION PROBLEMS; DATA ANALYSIS; DISCRETE OPTIMIZATION; FOLLOWING PROBLEMS; GENERAL APPROACHES; GENERAL CLASS; MAXIMUM CONSECUTIVE SUBSEQUENCE; OPTIMAL SOLUTIONS;

BIOINFORMATICS; DATA STRUCTURES; MAINTENANCE; OPTIMIZATION;

COMPUTER AIDED DIAGNOSIS;

EID: 67349208453     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2009.01.001     Document Type: Article

References (13)

1. Aronov B., and Har-Peled S. On approximating the depth and related problems. SIAM J. Comput. 38 3 (2008) 899-921
2. Bentley J.L. Programming pearls: Algorithm design techniques. Comm. ACM 27 (1984) 865-873
3. J.L. Bentley, M.I. Shamos, A problem in multivariate statistics: Algorithms, data structure and applications, in: Proceedings of the 15th Annual Allerton Conference on Communications, Control, and Computing, 1977, pp. 193-201
4. Bespamyatnikh S., and Segal M. Covering a set of points by two axis-parallel boxes. Inform. Process. Lett. 75 (2000) 95-100
5. C. Cortés, J.M. Díaz-Báñez, J. Urrutia, Finding enclosing boxes with empty intersection, in: 23rd European Workshop on Computational Geometry, 2006, pp. 185-188
6. Chen K.-Y., and Chao K.-M. On the range maximum-sum segment query problem. In: Fleischer R., and Trippen G. (Eds). ISAAC 2004. Lecture Notes in Comput. Sci. vol. 3341 (2004) 294-305
7. Dobkin D.P., Gunopulos D., and Maass W. Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning. J. Comput. System Sci. 52 3 (1996) 453-470
8. Duda R., Hart P., and Stork D. Pattern Classification (2001), John Wiley and Sons, Inc.
9. Eckstein J., Hammer P.L., Liu Y., Nediak M., and Simeone B. The maximum box problem and its applications to data analysis. Comput. Optim. Appl. 23 (2002) 285-298
10. P.L. Hammer, T. Bonates, Logical analysis of data: From combinatorial optimization to medical applications, Rutcor Research Report, RRR 10-2005, Rutger University, NJ, USA, 2005
11. Hand H., Mannila H., and Smyth P. Principles of Data Mining (2001), MIT Press
12. Knuth D.E. Sorting and Searching. The Art of Computer Programming (2000), Addison-Wesley
13. Y. Liu, M. Nediak, Planar case of the maximum box and related problems, in: Proc. 15th Canad. Conf. Comp. Geom., Halifax, Nova Scotia, 2003