The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Um problema de obtenção de uma transferência ótima de arquivos em uma rede de transmissão de arquivos N é considerar como distribuir, com um custo total mínimo, cópias de um determinado arquivo de informações de alguns vértices para outros em N pelos números de demanda de cópia dos respectivos vértices. Este artigo prova que tal problema é NP-difícil em geral.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Yoshihiro KANEKO, Shoji SHINODA, "The Complexity of an Optimal File Transfer Problem" in IEICE TRANSACTIONS on Fundamentals,
vol. E82-A, no. 2, pp. 394-397, February 1999, doi: .
Abstract: A problem of obtaining an optimal file transfer on a file transmission net N is to consider how to distribute, with a minimum total cost, copies of a certain file of information from some vertices to others on N by the respective vertices' copy demand numbers. This paper proves such a problem to be NP-hard in general.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e82-a_2_394/_p
Copiar
@ARTICLE{e82-a_2_394,
author={Yoshihiro KANEKO, Shoji SHINODA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={The Complexity of an Optimal File Transfer Problem},
year={1999},
volume={E82-A},
number={2},
pages={394-397},
abstract={A problem of obtaining an optimal file transfer on a file transmission net N is to consider how to distribute, with a minimum total cost, copies of a certain file of information from some vertices to others on N by the respective vertices' copy demand numbers. This paper proves such a problem to be NP-hard in general.},
keywords={},
doi={},
ISSN={},
month={February},}
Copiar
TY - JOUR
TI - The Complexity of an Optimal File Transfer Problem
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 394
EP - 397
AU - Yoshihiro KANEKO
AU - Shoji SHINODA
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E82-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 1999
AB - A problem of obtaining an optimal file transfer on a file transmission net N is to consider how to distribute, with a minimum total cost, copies of a certain file of information from some vertices to others on N by the respective vertices' copy demand numbers. This paper proves such a problem to be NP-hard in general.
ER -