Pages that link to "Item:Q1386346"

The following pages link to Approximation algorithms for connected dominating sets (Q1386346):

Displaying 50 items.

• Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA (Q1928496) (← links)
• Wireless networking, dominating and packing (Q1958633) (← links)
• On approximation of dominating tree in wireless sensor networks (Q1958639) (← links)
• Nearly tight approximation algorithm for (connected) Roman dominating set (Q2080821) (← links)
• 2-node-connectivity network design (Q2117701) (← links)
• Approximating \(k\)-connected \(m\)-dominating sets (Q2144267) (← links)
• A polynomial-time approximation to a minimum dominating set in a graph (Q2166772) (← links)
• A game theoretic approach for minimal connected dominating set (Q2193269) (← links)
• Improved budgeted connected domination and budgeted edge-vertex domination (Q2222087) (← links)
• A polylogarithmic approximation algorithm for 2-edge-connected dominating set (Q2234806) (← links)
• Computing a tree having a small vertex cover (Q2272400) (← links)
• Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
• Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks (Q2322692) (← links)
• On the approximability and hardness of the minimum connected dominating set with routing cost constraint (Q2326407) (← links)
• Algorithm and complexity of the two disjoint connected dominating sets problem on trees (Q2335669) (← links)
• Approximating spanning trees with few branches (Q2344216) (← links)
• On connected dominating sets of restricted diameter (Q2356248) (← links)
• Complexity issues of variants of secure domination in graphs (Q2413340) (← links)
• Revisiting connected dominating sets: an almost optimal local information algorithm (Q2414868) (← links)
• Routing-efficient CDS construction in disk-containment graphs (Q2448125) (← links)
• Code updates based on minimal backbone and group key management for secure sensor networks (Q2450530) (← links)
• On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs (Q2456357) (← links)
• Improving construction for connected dominating set with Steiner tree in wireless sensor networks (Q2505562) (← links)
• Message and time efficient multi-broadcast schemes (Q2513670) (← links)
• Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons (Q2575833) (← links)
• Dominating problems in swapped networks (Q2629991) (← links)
• On constructing strongly connected dominating and absorbing set in 3-dimensional wireless ad hoc networks (Q2658460) (← links)
• Construction of minimum edge-fault tolerant connected dominating set in a general graph (Q2698012) (← links)
• Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs (Q2938747) (← links)
• Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem (Q2940057) (← links)
• Approximability results for the converse connected<i>p</i>-centre problem^† (Q2958261) (← links)
• On the Power of Lookahead in Greedy Scheme for Finding a Minimum CDS for Unit Disk Graphs (Q2970204) (← links)
• On the Structure of Graphs Vertex Critical with Respect to Connected Domination (Q2971614) (← links)
• LEARNING AUTOMATA-BASED ALGORITHMS FOR FINDING MINIMUM WEAKLY CONNECTED DOMINATING SET IN STOCHASTIC GRAPHS (Q3070074) (← links)
• A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets (Q3177875) (← links)
• Finding Totally Independent Spanning Trees with Linear Integer Programming (Q3195324) (← links)
• An Algorithm for the Inverse Distance-2 Dominating Set of a Graph (Q3296826) (← links)
• (Q3301010) (← links)
• Connected Domination (Q3384607) (← links)
• Algorithms for Steiner Connected Dominating Set Problem Based on Learning Automata Theory (Q3455753) (← links)
• MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS (Q3634203) (← links)
• (Q4472438) (← links)
• Approximation algorithms for connected dominating sets (Q4595486) (← links)
• (Q4680214) (← links)
• Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination (Q5041206) (← links)
• A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets (Q5085993) (← links)
• (Q5090485) (← links)
• Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs (Q5131721) (← links)
• Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set (Q5131722) (← links)
• TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET (Q5189988) (← links)