I proposed an approximate solution to the NP-Hard Minimum Dominating Set Problem for general graphs G = (V, E) in O(|V| log |V| + |E|). The experimental findings demonstrate a 2-approximation ratio for this problem providing compelling evidence that P = NP
Bipartite-Based 2-Approximation for Dominating Sets in General Graphs Frank Vega ・ Apr 6 #programming #algorithms #computerscience #python
