Approximation Algorithm for the Minimum Hub Cover Set Problem

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...

Full description

Bibliographic Details
Main Authors: Joel A. Trejo-Sanchez, Candelaria E. Sansores-Perez, Jesus Garcia-Diaz, Jose Alberto Fernandez-Zepeda
Format: Article
Language:English
Published: IEEE 2022-01-01
Series:IEEE Access
Subjects:
Approximation algorithms
heuristics
minimum hub cover set
optimization
Online Access:https://ieeexplore.ieee.org/document/9771189/

Similar Items

Similar Items