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
Este artigo trata do problema de empacotamento de 2 caminhos de peso máximo (M2PP), que é o problema de calcular um conjunto de caminhos disjuntos de vértices de comprimento 2 em um determinado grafo completo ponderado por arestas, de modo que o peso total das arestas no caminhos é maximizado. Anteriormente, Hassin e Rubinstein forneceram um algoritmo aleatório de aproximação de tempo cúbico para M2PP que atinge uma proporção esperada de
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
Ruka TANAHASHI, Zhi-Zhong CHEN, "A Deterministic Approximation Algorithm for Maximum 2-Path Packing" in IEICE TRANSACTIONS on Information,
vol. E93-D, no. 2, pp. 241-249, February 2010, doi: 10.1587/transinf.E93.D.241.
Abstract: This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted complete graph so that the total weight of edges in the paths is maximized. Previously, Hassin and Rubinstein gave a randomized cubic-time approximation algorithm for M2PP which achieves an expected ratio of
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E93.D.241/_p
Copiar
@ARTICLE{e93-d_2_241,
author={Ruka TANAHASHI, Zhi-Zhong CHEN, },
journal={IEICE TRANSACTIONS on Information},
title={A Deterministic Approximation Algorithm for Maximum 2-Path Packing},
year={2010},
volume={E93-D},
number={2},
pages={241-249},
abstract={This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted complete graph so that the total weight of edges in the paths is maximized. Previously, Hassin and Rubinstein gave a randomized cubic-time approximation algorithm for M2PP which achieves an expected ratio of
keywords={},
doi={10.1587/transinf.E93.D.241},
ISSN={1745-1361},
month={February},}
Copiar
TY - JOUR
TI - A Deterministic Approximation Algorithm for Maximum 2-Path Packing
T2 - IEICE TRANSACTIONS on Information
SP - 241
EP - 249
AU - Ruka TANAHASHI
AU - Zhi-Zhong CHEN
PY - 2010
DO - 10.1587/transinf.E93.D.241
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E93-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2010
AB - This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted complete graph so that the total weight of edges in the paths is maximized. Previously, Hassin and Rubinstein gave a randomized cubic-time approximation algorithm for M2PP which achieves an expected ratio of
ER -