Connected dominating set. Theory and applications
From MaRDI portal
Publication:436191
DOI10.1007/978-1-4614-5242-3zbMath1278.05003OpenAlexW564518845MaRDI QIDQ436191
Publication date: 30 July 2012
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-5242-3
Programming involving graphs or networks (90C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Greedy approximation for the minimum connected dominating set with labeling, Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination, Semitotal domination on AT-free graphs and circle graphs, On approximating (connected) 2-edge dominating set by a tree, Parallel algorithm for minimum partial dominating set in unit disk graph, Making a dominating set of a graph connected, Robust Connectivity of Graphs on Surfaces, NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs, The \(k\)-hop connected dominating set problem: approximation and hardness, Revisiting connected dominating sets: an almost optimal local information algorithm, Statistical mechanics of the minimum dominating set problem, On imposing connectivity constraints in integer programs, Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph, Covariant bit threads, Data-driven soliton mappings for integrable fractional nonlinear wave equations via deep learning with Fourier neural operator, A game theoretic approach for minimal connected dominating set, Nordhaus-Gaddum-type results on the connected edge domination number, Domination and its variants in split graphs \(-\text{P}\) versus NPC dichotomy, Construction of minimum edge-fault tolerant connected dominating set in a general graph, Improved budgeted connected domination and budgeted edge-vertex domination, The Optimal Design of Low-Latency Virtual Backbones, Online dominating set, Unnamed Item, Exact and heuristic algorithms for the weighted total domination problem, 2-edge connected dominating sets and 2-connected dominating sets of a graph, Approximation algorithms for the connected sensor cover problem, Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems, Connected Domination, Approximation algorithms for connected maximum cut and related problems, Linear separation of connected dominating sets in graphs, Optimal control of a 2D diffusion-advection process with a team of mobile actuators under jointly optimal guidance, Unnamed Item, Optimal guidance and estimation of a 2D diffusion-advection process by a team of mobile sensors, Exact algorithms for the minimum \(s\)-club partitioning problem, A proof of a conjecture on the connected domination number, Local planar domination revisited
