LIPIcs.STACS.2009.1816.pdf
- Filesize: 230 kB
- 12 pages
Document
An Approximation Algorithm for l_infinity Fitting Robinson Structures to Distances
Authors
-
Part of:
Volume:
26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Theoretical Aspects of Computer Science (STACS) - License:
Creative Commons Attribution-NoDerivs 3.0 Unported license
- Publication Date: 2009-02-19
Cite AsGet BibTex
Victor Chepoi and Morgan Seston. An Approximation Algorithm for l_infinity Fitting Robinson Structures to Distances. In 26th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 3, pp. 265-276, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/LIPIcs.STACS.2009.1816
https://doi.org/10.4230/LIPIcs.STACS.2009.1816
Abstract
In this paper, we present a factor 16 approximation algorithm for the following NP-hard distance fitting problem: given a finite set $X$ and a distance $d$ on $X$, find a Robinsonian distance $d_R$ on $X$ minimizing the $l_{\infty}$-error $||d-d_R||_{\infty}=\mbox{max}_{x,y\in X}\{ |d(x,y)-d_R(x,y)|\}.$ A distance $d_R$ on a finite set $X$ is Robinsonian if its matrix can be symmetrically permuted so that its elements do not decrease when moving away from the main diagonalalong any row or column. Robinsonian distances generalize ultrametrics, line distances and occur in the seriation problems and in classification.
Keywords
- Robinsonian dissimilarity
- Approximation algorithm
- Fitting problem
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads