Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6874170 | Information Processing Letters | 2018 | 6 Pages |
Abstract
In this paper, we study the following question: How do we compute a geometric median for a given subset Ψ of R(P,H,Ï) relative to d, i.e. an element ÏmedâR(P,H,Ï) such thatâÏâ²âΨd(Ïmed,Ïâ²)â¤âÏâ²âΨd(Ï,Ïâ²) holds for all ÏâR(P,H,Ï)? For a model where so-called host-switches or transfers are not allowed, and for a commonly used metric d called the edit-distance, we show that it is possible to compute a geometric median for a set Ψ in R(P,H,Ï) in polynomial time. We expect that this result could open up new directions for computing a consensus for a set of reconciliations.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Katharina T. Huber, Vincent Moulton, Marie-France Sagot, Blerina Sinaimeri,