Approximation Algorithm for the Minimum Hub Cover Set Problem
A subset <inline-formula> <tex-math notation="LaTeX">${\mathcal{ S}}\subseteq V$ </tex-math></inline-formula> of vertices of an undirected graph <inline-formula> <tex-math notation="LaTeX">$G=(V,E)$ </tex-math></inline-formula> is a...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2022-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9771189/ |