| Type of document: |
 |
Peer-reviewed conferences/proceedings |
|
| Domain: |
|
|
|
| Title: |
|
An Approximation Algorithm for l∞-Fitting Robinson Structures to Distances |
|
| Author(s): |
|
Victor Chepoi ( ) 1, Morgan Seston () 1 |
|
| Research team(s): |
|
|
|
| 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 dR on X minimizing the l∞-error ||d − dR||∞ = maxx,y∈X {|d(x, y) − dR(x, y)|}. A distance dR 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 diagonal along any row or column. Robinsonian distances generalize ultrametrics, line distances and occur in the seriation problems and in classification. |
|
| Full text language: |
|
English |
|
|
| Publication date: |
|
2009 |
|
| Audience: |
|
international |
|
| Conference title: |
|
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009 |
|
| Conference city: |
|
Freiburg |
|
| Country: |
|
Germany |
|
| Conference date: |
|
2009-02-26 |
|
| Scientific editor(s): |
|
Susanne Albers and Jean-Yves Marion |
|
| Commercial editor: |
|
IBFI Schloss Dagstuhl |
|
| Volume title : |
|
Proceedings of the 26th Annual Symposium on the Theoretical Aspects of Computer Science |
|
| Pagination: |
|
265-276 |
|
|
| Keywords: |
|
Robinsonian dissimilarity – approximation algorithm – fitting problem |
|
BibTeX,EndNote,...
