关于“最小2边连通生成子图问题的一种新的近似算法”的撤回通知[理论计算机科学943 (2023)121-130]

IF 1 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Theoretical Computer Science Pub Date : 2025-06-03 DOI:10.1016/j.tcs.2025.115346

A. Çivril

{"title":"关于“最小2边连通生成子图问题的一种新的近似算法”的撤回通知[理论计算机科学943 (2023)121-130]","authors":"A. Çivril","doi":"10.1016/j.tcs.2025.115346","DOIUrl":null,"url":null,"abstract":"<div><div>This article has been retracted: please see Elsevier Policy on Article Withdrawal (<span><span>https://www.elsevier.com/locate/withdrawalpolicy</span><svg><path></path></svg></span>).</div><div>This article has been retracted at the request of the Author.</div><div>The journal previously published a corrigendum on behalf of the author that completed the analysis of Case 3 of Lemma 2 in the original publication. Further concerns about the study were raised by the author after the corrigendum published, which led to a full review of the manuscript by the Editor-in-Chief. After careful review, the analysis of the algorithm and the correctness proofs repeatedly use the inequality: OPT(G) ≥ OPT(G’) + l-1. This inequality is used first in the proof of Lemma 2 (Section 4) and is used repeatedly in the sequel of the paper. Unfortunately, the inequality does not hold in all input graphs. Without this inequality, the proofs of Section 4 are not valid and the claimed main results of the paper about improved approximation ratios do not hold.</div><div>Due to the above concerns, the Editor-in-Chief of Theoretical Computer Science, Section A has decided to retract the paper.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1048 ","pages":"Article 115346"},"PeriodicalIF":1.0000,"publicationDate":"2025-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Retraction notice to “A New Approximation Algorithm for the Minimum 2-Edge-Connected Spanning Subgraph Problem” [Theoretical Computer Science 943 (2023) 121-130]\",\"authors\":\"A. Çivril\",\"doi\":\"10.1016/j.tcs.2025.115346\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>This article has been retracted: please see Elsevier Policy on Article Withdrawal (<span><span>https://www.elsevier.com/locate/withdrawalpolicy</span><svg><path></path></svg></span>).</div><div>This article has been retracted at the request of the Author.</div><div>The journal previously published a corrigendum on behalf of the author that completed the analysis of Case 3 of Lemma 2 in the original publication. Further concerns about the study were raised by the author after the corrigendum published, which led to a full review of the manuscript by the Editor-in-Chief. After careful review, the analysis of the algorithm and the correctness proofs repeatedly use the inequality: OPT(G) ≥ OPT(G’) + l-1. This inequality is used first in the proof of Lemma 2 (Section 4) and is used repeatedly in the sequel of the paper. Unfortunately, the inequality does not hold in all input graphs. Without this inequality, the proofs of Section 4 are not valid and the claimed main results of the paper about improved approximation ratios do not hold.</div><div>Due to the above concerns, the Editor-in-Chief of Theoretical Computer Science, Section A has decided to retract the paper.</div></div>\",\"PeriodicalId\":49438,\"journal\":{\"name\":\"Theoretical Computer Science\",\"volume\":\"1048 \",\"pages\":\"Article 115346\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2025-06-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Theoretical Computer Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0304397525002841\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397525002841","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

这篇文章已被撤回：请参见爱思唯尔文章撤回政策（https://www.elsevier.com/locate/withdrawalpolicy）.This文章已应作者要求被撤回。该杂志先前代表完成原稿中引理2的案例3分析的作者发表了一份勘误表。在更正发布后，作者对该研究提出了进一步的担忧，这导致主编对手稿进行了全面审查。经过仔细审核，算法分析和正确性证明反复使用不等式：OPT(G)≥OPT（G’） + l-1。这个不等式首先在引理2（第4节）的证明中使用，并在本文的后续部分中反复使用。不幸的是，这个不等式并不适用于所有的输入图。如果没有这个不等式，第4节的证明就不成立，本文所声称的关于改进的近似比的主要结果也不成立。基于以上考虑，《理论计算机科学》A部总编辑决定撤销该论文。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Retraction notice to “A New Approximation Algorithm for the Minimum 2-Edge-Connected Spanning Subgraph Problem” [Theoretical Computer Science 943 (2023) 121-130]

This article has been retracted: please see Elsevier Policy on Article Withdrawal (https://www.elsevier.com/locate/withdrawalpolicy).

This article has been retracted at the request of the Author.

The journal previously published a corrigendum on behalf of the author that completed the analysis of Case 3 of Lemma 2 in the original publication. Further concerns about the study were raised by the author after the corrigendum published, which led to a full review of the manuscript by the Editor-in-Chief. After careful review, the analysis of the algorithm and the correctness proofs repeatedly use the inequality: OPT(G) ≥ OPT(G’) + l-1. This inequality is used first in the proof of Lemma 2 (Section 4) and is used repeatedly in the sequel of the paper. Unfortunately, the inequality does not hold in all input graphs. Without this inequality, the proofs of Section 4 are not valid and the claimed main results of the paper about improved approximation ratios do not hold.

Due to the above concerns, the Editor-in-Chief of Theoretical Computer Science, Section A has decided to retract the paper.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Theoretical Computer Science 工程技术-计算机：理论方法

CiteScore

2.60

自引率

18.20%

发文量

471

审稿时长

12.6 months

期刊介绍： Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.