Academic Journal

An Improved Approximation Algorithm for the Minimum 4-Star Partition Problem.

Bibliographic Details
Title: An Improved Approximation Algorithm for the Minimum 4-Star Partition Problem.
Authors: Bao, Qilu1 (AUTHOR) y30221652@mail.ecust.edu.cn, Yu, Wei1 (AUTHOR) yuwei@ecust.edu.cn, Liu, Zhaohui1 (AUTHOR) zhliu@ecust.edu.cn, Chen, Yong2 (AUTHOR) chenyong@hdu.edu.cn
Source: International Journal of Foundations of Computer Science. Jun2026, Vol. 37 Issue 4, p525-536. 12p.
Subject Terms: *Algorithms, *Heuristic, Approximation algorithms, Star graphs (Graph theory), Combinatorial optimization, Graph theory
Abstract: In this paper, we investigate the minimum k-star partition problem (Min-kSP for short) in which we are given an undirected graph and the objective is to compute a minimum number of vertex-disjoint stars containing at most k vertices such that all the vertices are covered by these stars. We design a 1 9 1 0 -approximation algorithm for the Min-4SP based on the local search method, which improves on the previous 2-approximation algorithm implied by the results in the literature. Our algorithm starts with a feasible solution containing the minimum number of singletons, i.e. stars containing a single vertex, and then iteratively applies four local search operations to reduce the number of stars. When no improvements is possible, the algorithm terminates and outputs the current solution. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Foundations of Computer Science is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Business Source Index
Description
ISSN:01290541
DOI:10.1142/S0129054125400027