Pages that link to "Item:Q4595486"
From MaRDI portal
The following pages link to Approximation algorithms for connected dominating sets (Q4595486):
Displaying 40 items.
- Connected dominating set. Theory and applications (Q436191) (← links)
- Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (Q437058) (← links)
- Complexity and approximation of the connected set-cover problem (Q453623) (← links)
- On connected domination in unit ball graphs (Q537633) (← links)
- A greedy approximation for minimum connected dominating sets (Q706637) (← links)
- Minimum connected dominating sets in finite graphs (Q712285) (← links)
- Greedy approximation for the minimum connected dominating set with labeling (Q828691) (← links)
- Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
- Approximation hardness of dominating set problems in bounded degree graphs (Q958303) (← links)
- Approximation algorithms for connected dominating sets (Q1386346) (← links)
- An exact algorithm for the maximum leaf spanning tree problem. (Q1413822) (← links)
- Algorithms for graphs with small octopus (Q1421464) (← links)
- The probabilistic minimum dominating set problem (Q1686054) (← links)
- Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem (Q1772870) (← links)
- Wireless networking, dominating and packing (Q1958633) (← links)
- On approximation of dominating tree in wireless sensor networks (Q1958639) (← links)
- Algorithmic aspects of secure connected domination in graphs (Q2042631) (← links)
- Nearly tight approximation algorithm for (connected) Roman dominating set (Q2080821) (← links)
- Approximating \(k\)-connected \(m\)-dominating sets (Q2144267) (← links)
- Leafy spanning \(k\)-forests (Q2165258) (← links)
- A polylogarithmic approximation algorithm for 2-edge-connected dominating set (Q2234806) (← links)
- Algorithm and complexity of the two disjoint connected dominating sets problem on trees (Q2335669) (← links)
- Revisiting connected dominating sets: an almost optimal local information algorithm (Q2414868) (← links)
- Improving construction for connected dominating set with Steiner tree in wireless sensor networks (Q2505562) (← links)
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons (Q2575833) (← links)
- Dominating problems in swapped networks (Q2629991) (← links)
- Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems (Q2839214) (← 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)
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks (Q4446911) (← links)
- (Q4472438) (← links)
- The maximum-leaf spanning tree problem: Formulations and facets (Q4474303) (← links)
- Revisiting connected dominating sets: an optimal local algorithm? (Q4636441) (← links)
- (Q4680214) (← links)
- TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET (Q5189988) (← links)
- On the Parameterized Complexity of Approximating Dominating Set (Q5215462) (← links)
- Computing and Combinatorics (Q5716997) (← links)
- Approximation Algorithms and Hardness for Domination with Propagation (Q5901134) (← links)
- Approximation algorithm for (connected) Italian dominating function (Q6090069) (← links)
- A unified greedy approximation for several dominating set problems (Q6093579) (← links)