Please use this identifier to cite or link to this item:
|Title:||On the polynomiality of finding (K)DMDGP re-orders|
Carvalho, Luiz Mariano
|Abstract:||In Cassioli et al. (2015), the complexity of finding (K)DMDGP re-orders was stated to be NP-complete by inclusion, which fails to provide a complete picture. In this paper we show that this problem is indeed NP-complete for K = 1, but it is in P for each fixed K >= 2|
|Subject:||Geometria de distâncias|
|Appears in Collections:||IMECC - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.