A Performance Study of Some Approximation Algorithms for Computing a Small Dominating Set in a Graph

A Performance Study of Some Approximation Algorithms for Computing a Small Dominating Set in a Graph

We implement and test the performances of several approximation algorithms for computing the minimum dominating set of a graph. These algorithms are the standard greedy algorithm, the recent Linear programming (LP) rounding algorithms and a hybrid algorithm that we design by combining the greedy and...

Full description

Bibliographic Details
Main Authors: Jonathan Li, Rohan Potru, Farhad Shahrokhi
Format: Article
Language:English
Published: MDPI AG 2020-12-01
Series:Algorithms
Subjects:
minimum dominating set
linear programming
experimentation
Online Access:https://www.mdpi.com/1999-4893/13/12/339

Internet

https://www.mdpi.com/1999-4893/13/12/339

Similar Items