An Approximation Algorithm for l∞-Fitting Robinson Structures to Distances - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

An Approximation Algorithm for l∞-Fitting Robinson Structures to Distances

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.
Fichier principal
Vignette du fichier
chepoi_new.pdf (275.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00359296 , version 1 (06-02-2009)

Identifiers

  • HAL Id : inria-00359296 , version 1
  • ARXIV : 0902.1261

Cite

Victor Chepoi, Morgan Seston. An Approximation Algorithm for l∞-Fitting Robinson Structures to Distances. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.265-276. ⟨inria-00359296⟩
147 View
128 Download

Altmetric

Share

Gmail Facebook X LinkedIn More