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
본 논문은 최대 가중치 2경로 패킹 문제(M2PP)를 다룬다. 이는 주어진 간선 가중치 완전 그래프에서 길이가 2인 정점 분리 경로 집합을 계산하여 각 간선의 총 가중치를 계산하는 문제이다. 경로가 최대화됩니다. 이전에 Hassin과 Rubinstein은 다음의 예상 비율을 달성하는 M2PP에 대한 무작위 입방 시간 근사 알고리즘을 제공했습니다.
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.
부
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
부
@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},}
부
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 -