Published in

Algorithms from and for Nature and Life, p. 33-46

DOI: 10.1007/978-3-319-00035-0_3

Links

Tools

Export citation

Search in Google Scholar

Solving the Minimum Sum of L1 Distances Clustering Problem by Hyperbolic Smoothing and Partition into Boundary and Gravitational Regions

Proceedings article published in 2012 by Adilson Elias Xavier, Vinicius Layter Xavier ORCID, Sergio B. Villas-Boas
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO