<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">445804882</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317145153.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20110401xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00453-009-9319-y</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00453-009-9319-y</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Seriation in the Presence of Errors: AFactor16Approximation Algorithm for l ∞-FittingRobinson Structures to Distances</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Victor Chepoi, Morgan Seston]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">The classical seriation problem consists in finding a permutation of the rows and the columns of the distance (or, more generally, dissimilarity) matrix d on a finite set X so that small values should be concentrated around the main diagonal as close as possible, whereas large values should fall as far from it as possible. This goal is best achieved by considering the Robinson property: a distance d R on 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. If the distance d fails to satisfy the Robinson property, then we are lead to the problem of finding a reordering of d which is as close as possible to a Robinsonian distance. In this paper, we present a factor 16 approximation algorithm for the following NP-hard fitting problem: given a finite set X and a dissimilarity d on X, we wish to find a Robinsonian dissimilarity d R on X minimizing the l ∞-error ‖d−d R‖∞=max x,y∈X{|d(x,y)−d R(x,y)|} between d and d R.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media, LLC, 2009</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Robinsonian dissimilarity</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Approximation algorithm</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Fitting problem</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Chepoi</subfield>
   <subfield code="D">Victor</subfield>
   <subfield code="u">Laboratoire d'Informatique Fondamentale de Marseille, Faculté des Sciences de Luminy, Université d'Aix-Marseille, 13288, Marseille Cedex 9, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Seston</subfield>
   <subfield code="D">Morgan</subfield>
   <subfield code="u">Laboratoire d'Informatique Fondamentale de Marseille, Faculté des Sciences de Luminy, Université d'Aix-Marseille, 13288, Marseille Cedex 9, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Algorithmica</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">59/4(2011-04-01), 521-568</subfield>
   <subfield code="x">0178-4617</subfield>
   <subfield code="q">59:4&lt;521</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">59</subfield>
   <subfield code="o">453</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s00453-009-9319-y</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s00453-009-9319-y</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Chepoi</subfield>
   <subfield code="D">Victor</subfield>
   <subfield code="u">Laboratoire d'Informatique Fondamentale de Marseille, Faculté des Sciences de Luminy, Université d'Aix-Marseille, 13288, Marseille Cedex 9, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Seston</subfield>
   <subfield code="D">Morgan</subfield>
   <subfield code="u">Laboratoire d'Informatique Fondamentale de Marseille, Faculté des Sciences de Luminy, Université d'Aix-Marseille, 13288, Marseille Cedex 9, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Algorithmica</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">59/4(2011-04-01), 521-568</subfield>
   <subfield code="x">0178-4617</subfield>
   <subfield code="q">59:4&lt;521</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">59</subfield>
   <subfield code="o">453</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
