Recognition of Robinsonian dissimilarities
Author
Abstract
Suggested Citation
DOI: 10.1007/s003579900015
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Victor Chepoi & Bernard Fichet & Morgan Seston, 2009. "Seriation in the Presence of Errors: NP-Hardness of l ∞ -Fitting Robinson Structures to Dissimilarity Matrices," Journal of Classification, Springer;The Classification Society, vol. 26(3), pages 279-296, December.
- Laurent, Monique & Seminaroti, Matteo, 2016. "Similarity-First Search : A New Algorithm With Application to Robinsonian Matrix Recognition," Other publications TiSEM 8468be57-ed46-400c-9c0e-7, Tilburg University, School of Economics and Management.
- Matthijs Warrens, 2009. "On Robinsonian dissimilarities, the consecutive ones property and latent variable models," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 3(2), pages 169-184, September.
- Laurent, Monique & Seminaroti, M. & Tanigawa, Shin-ichi, 2017. "A structural characterization for certifying robinsonian matrices," Other publications TiSEM 5ecebfb8-804e-4267-8c12-b, Tilburg University, School of Economics and Management.
- J.-P. Barthélemy & F. Brucker & C. Osswald, 2007. "Combinatorial optimisation and hierarchical classifications," Annals of Operations Research, Springer, vol. 153(1), pages 179-214, September.
- Julio Aracena & Christopher Thraves Caro, 2023. "The weighted sitting closer to friends than enemies problem in the line," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-21, January.
More about this item
Keywords
Robinsonian dissimilarities; Order compatible with a dissimilarity; Divide-and-conquer algorithm;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jclass:v:14:y:1997:i:2:p:311-325. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.