Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/337841
Type: Artigo
Title: On the polynomiality of finding (K)DMDGP re-orders
Author: Lavor, Carlile
Souza, Michael
Carvalho, Luiz Mariano
Liberti, Leo
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
Country: Países Baixos
Editor: Elsevier
Rights: Fechado
Identifier DOI: 10.1016/j.dam.2019.07.021
Address: https://www.sciencedirect.com/science/article/pii/S0166218X19303373
Date Issue: 2019
Appears in Collections:IMECC - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
000485852500017.pdf401.5 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.