Artículo
Cabrelli, C.A.; Molter, U.M. "A linear time algorithm for a matching problem on the circle" (1998) Information Processing Letters. 66(3):161-164
Consulte la política de Acceso Abierto del editor
Registro:
| Documento: | Artículo |
| Título: | A linear time algorithm for a matching problem on the circle |
| Autor: | Cabrelli, C.A.; Molter, U.M. |
| Filiación: | Departamento de Matemática, Fac. de Ciencias Exactas y Naturales, Pabellón I, 1428 Buenos Aires, Argentina |
| Palabras clave: | Algorithms; Computational complexity; Minimal matching |
| Año: | 1998 |
| Volumen: | 66 |
| Número: | 3 |
| Página de inicio: | 161 |
| Página de fin: | 164 |
| Título revista: | Information Processing Letters |
| Título revista abreviado: | Inf. Process. Lett. |
| ISSN: | 00200190 |
| CODEN: | IFPLA |
| Registro: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00200190_v66_n3_p161_Cabrelli |
Referencias:
- Bleich, C., Overton, M.L., (1983) A Linear-time Algorithm for the Weighted Median Problem, , Technical Report 75, Department of Computer Science, New York University
- Buss, S.R., Yianilos, P.N., Linear and O(n log n) time minimum-cost matching algorithms for quasi-convex tours (1994) Proc. SODA-94, pp. 65-76
- Cabrelli, C.A., Molter, U.M., The Kantorovich metric between probability measures on the circle (1995) J. Comput. Appl. Math., 57, pp. 345-361
- Chen, H.C., Wong, A.K.C., Generalized texture representation and metric (1983) Comput. Vision Graphics Image Process, 23, pp. 182-206
- Gurwitz, C., Weighted median algorithms for L1 approximation (1990) BIT, 30, pp. 301-310
- Johnson, D.B., Mizoguchi, T., Selecting the kth element in X + Y and X1 + X2 + ⋯+ Xm (1978) SIAM J. Comput., 7, pp. 147-153
- Karp, R.M., Li, S.-Y.R., Two special cases of the assignment problem (1975) Discrete Math., 13, pp. 129-142
- Reiser, A., A linear selection algorithm for sets of elements with weights (1978) Inform. Process. Lett., 7, pp. 159-162
- Shamos, M.I., Geometry and statistics (1976) Algorithms and Complexity: New Directions and Recent Results, pp. 251-280. , J.F. Traub (Ed.), Academic Press
- Werman, M., Peleg, S., Melter, R., Kong, T.Y., Bipartite graph matching for points on a line or a circle (1986) J. Algorithms, 7, pp. 277-284
- Werman, M., Peleg, S., Rosenfeld, A., (1984) A Distance Metric for Multidimensional Histograms, , Technical Report 90, CAR-TR-90, Center for Automation Research, University of Maryland
Citas:
---------- APA ----------
Cabrelli, C.A. & Molter, U.M. (1998) . A linear time algorithm for a matching problem on the circle. Information Processing Letters, 66(3), 161-164.Recuperado de https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00200190_v66_n3_p161_Cabrelli [ ]
---------- CHICAGO ----------
Cabrelli, C.A., Molter, U.M. "A linear time algorithm for a matching problem on the circle" . Information Processing Letters 66, no. 3 (1998) : 161-164.Recuperado de https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00200190_v66_n3_p161_Cabrelli [ ]
---------- MLA ----------
Cabrelli, C.A., Molter, U.M. "A linear time algorithm for a matching problem on the circle" . Information Processing Letters, vol. 66, no. 3, 1998, pp. 161-164.Recuperado de https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00200190_v66_n3_p161_Cabrelli [ ]
---------- VANCOUVER ----------
Cabrelli, C.A., Molter, U.M. A linear time algorithm for a matching problem on the circle. Inf. Process. Lett. 1998;66(3):161-164.Available from: https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00200190_v66_n3_p161_Cabrelli [ ]
