A Unified Approach for Domination Problems on Different Network Topologies
نویسندگان
چکیده
We provide tight hardness results and approxiamation algorithms for many existing domination problems. We start with the positive influence dominating set (PIDS) problem, originated from the context of influence propagation in social networks. The PIDS problem seeks for a minimal set of nodes P such that all other nodes in the network have at least a fraction ρ > 0 of their neighbors in P; in the total version (T-PIDS), nodes in P are required to have a fraction ρ of neighbors inside P; and in the connected version (C-PIDS) the dominating set have to induce a connected subgraph. Then, we unify a large variations of dominating set problem under a single generalized dominating set problem. We show a tight hardness results 1 2(1− o(1)) lnn inapproximability and a ln∆ + O(1) approximation algorithms for our generalized dominating set problem where n is the newtork size and ∆ is the maximum degree. The results apply directly to PIDS, k-tuple dominating set, m-connected k-dominating set, Fixed Threshold Dominating Set and many existing domination problems plus all connected or/and total versions of those problems. As most previous hardness results are NP-completeness or APXhardness, we effectively close many long-standing approximation gaps of domination problems, under the reasonable assumption that NP 6⊂ DTIME(nO(loglogn)). In networks with degrees bounded by a constant B, we show that all problems cannot be approximated within lnB−O(ln lnB), unless P=NP. In dense networks and scale-free networks such as Internet, WWW, social networks, etc. in which degree sequences follows a power-law distribution, we reveal trivial constant factor approximation algorithms for the class of PIDS-like domination problems. Finally, we prove that optimal solution of any domination problems can be found in linear time for networks with tree topology. Thang N. Dinh University of Florida, Gainesville, FL 32611, US; e-mail: [email protected] Dung T. Nguyen University of Florida, Gainesville, FL 32611, US; e-mail: [email protected] My T. Thai University of Florida, Gainesville, FL 32611, US; e-mail: [email protected]
منابع مشابه
Optimal Coordination of Distance and Directional Overcurrent Relays Considering Different Network Topologies
Most studies in relay coordination have focused solely on coordination of overcurrent relays while distance relays are used as the main protection of transmission lines. Since, simultaneous coordination of these two types of relays can provide a better protection, in this paper, a new approach is proposed for simultaneous coordination of distance and directional overcurrent relays (D&DOCRs). Al...
متن کاملOptimal Locating and Sizing of Unified Power Quality Conditioner- phase Angle Control for Reactive Power Compensation in Radial Distribution Network with Wind Generation
In this article, a multi-objective planning is demonstrated for reactive power compensation in radial distribution networks with wind generation via unified power quality conditioner (UPQC). UPQC model, based on phase angle control (PAC), is used. In presented method, optimal locating of UPQC-PAC is done by simultaneous minimizing of objective functions such as: grid power loss, percentage of n...
متن کاملUML Modeling of Network Topologies for Distributed Computer System
Nowadays, distributed computer systems have become very popular approach of computing as it delivers high end performance at a low cost. In a distributed computing environment, autonomous computers are connected by means of a communication network, arranged in a geometrical shape called network topology. In the present paper a detailed study of network topologies is done for the distributed com...
متن کاملA Unified Approach for Design of Lp Polynomial Algorithms
By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...
متن کاملCombined Use of Sensitivity Analysis and Hybrid Wavelet-PSO- ANFIS to Improve Dynamic Performance of DFIG-Based Wind Generation
In the past few decades, increasing growth of wind power plants causes different problems for the power quality in the grid. Normal and transient impacts of these units on the power grid clearly indicate the need to improve the quality of the electricity generated by them in the design of such systems. Improving the efficiency of the large-scale wind system is dependent on the control parameter...
متن کامل