scientific article

zbMath1192.90224MaRDI QIDQ3579442

Weili Wu, Peng-Jun Wan, Ding-Zhu Du, Wen-Bo Zhao, Panos M. Pardalos, Ronald L. Graham

Publication date: 6 August 2010

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items

Greedy approximation for the minimum connected dominating set with labeling, Influence maximization problem: properties and algorithms, The \(k\)-hop connected dominating set problem: hardness and polyhedra, Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs, A cross-monotonic cost-sharing scheme for the concave facility location game, A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks, New dominating sets in social networks, The \(k\)-hop connected dominating set problem: approximation and hardness, A greedy algorithm for the fault-tolerant connected dominating set in a general graph, On positive influence dominating sets in social networks, A unified greedy approximation for several dominating set problems, Fault-tolerant total domination via submodular function approximation, Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks, Wireless networking, dominating and packing, Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set, Minimum non-submodular cover problem with applications, On minimum submodular cover with submodular cost, A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem, Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem, Algorithmic complexity of weakly connected Roman domination in graphs