A strongly polynomial time approximation algorithm for the min-max clustered cycle cover problem

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

Theoretical Computer Science Pub Date : 2024-12-27 DOI:10.1016/j.tcs.2024.115050

Pengxiang Pan , Hongtao Zhu

{"title":"A strongly polynomial time approximation algorithm for the min-max clustered cycle cover problem","authors":"Pengxiang Pan , Hongtao Zhu","doi":"10.1016/j.tcs.2024.115050","DOIUrl":null,"url":null,"abstract":"<div><div>We reconsider the min-max clustered cycle cover (MM-CCC) problem, which is described as follows. Given an undirected complete graph <span><math><mi>G</mi><mo>=</mo><mo>(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo>;</mo><mi>w</mi><mo>)</mo></math></span> with a positive integer <em>k</em>, where the vertex set <em>V</em> is partitioned into <em>h</em> clusters <span><math><msub><mrow><mi>V</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>V</mi></mrow><mrow><mi>h</mi></mrow></msub></math></span>, and <span><math><mi>w</mi><mo>:</mo><mi>E</mi><mo>→</mo><msup><mrow><mi>R</mi></mrow><mrow><mo>+</mo></mrow></msup></math></span> is an edge-weight function satisfying the triangle inequality, it is asked to find <em>k</em> cycles such that they traverse all vertices and the vertices in each cluster are required to be traversed consecutively. The objective is to minimize the weight of the maximum weight cycle. We propose a strongly polynomial time 16-approximation algorithm for the MM-CCC problem. The result improves the previous algorithm in terms of running time.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1029 ","pages":"Article 115050"},"PeriodicalIF":0.9000,"publicationDate":"2024-12-27","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/S0304397524006674","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

Abstract

We reconsider the min-max clustered cycle cover (MM-CCC) problem, which is described as follows. Given an undirected complete graph

G = (V, E; w)

with a positive integer k, where the vertex set V is partitioned into h clusters

V_{1}, \dots, V_{h}

, and

w : E \to R^{+}

is an edge-weight function satisfying the triangle inequality, it is asked to find k cycles such that they traverse all vertices and the vertices in each cluster are required to be traversed consecutively. The objective is to minimize the weight of the maximum weight cycle. We propose a strongly polynomial time 16-approximation algorithm for the MM-CCC problem. The result improves the previous algorithm in terms of running time.

查看原文本刊更多论文

求助全文

约1分钟内获得全文求助全文

来源期刊

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.