Approximation algorithm for prize-collecting vertex cover with fairness constraints

Mingchao Zhou, Zhao Zhang () and Ding-Zhu Du
Additional contact information
Mingchao Zhou: Zhejiang Normal University
Zhao Zhang: Zhejiang Normal University
Ding-Zhu Du: University of Texas at Dallas

Journal of Combinatorial Optimization, 2024, vol. 48, issue 3, No 5, 18 pages

Abstract: Abstract Considering fairness has become increasingly important in recent research. This paper proposes the prize-collecting vertex cover problem with fairness constraints (FPCVC). In a prize-collecting vertex cover problem, those edges that are not covered incur penalties. By adding fairness concerns into the problem, the vertex set is divided into l groups, the goal is to find a vertex set to minimize the cost-plus-penalty value under the constraints that the profit of edges collected by each group exceeds a coverage requirement. In this paper, we propose a hybrid algorithm (combining deterministic rounding and randomized rounding) for the FPCVC problem which, with probability at least $$1-1/l^{\alpha }$$ 1 - 1 / l α , returns a feasible solution with an objective value at most $$\left( \frac{9(\alpha +1)}{2}\ln l+3\right) $$ 9 ( α + 1 ) 2 ln l + 3 times that of an optimal solution, where $$\alpha $$ α is a constant. We also show a lower bound of $$\Omega (\ln l)$$ Ω ( ln l ) for the approximability of FPCVC. Thus, our approximation ratio is asymptotically best possible. Experiments show that our algorithm performs fairly well empirically.

Keywords: Prize collecting vertex cover; Fairness constraints; Approximation algorithm (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-024-01215-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:48:y:2024:i:3:d:10.1007_s10878-024-01215-w

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-024-01215-w

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().