Pages that link to "Item:Q1603390"

The following pages link to On approximability of the independent/connected edge dominating set problems (Q1603390):

Displaying 20 items.

• PTAS for minimum weighted connected vertex cover problem with \(c\)-local condition in unit disk graphs (Q411246) (← links)
• On the max min vertex cover problem (Q499339) (← links)
• The price of connectivity for cycle transversals (Q739064) (← links)
• A 2-approximation algorithm for the minimum weight edge dominating set problem (Q1602689) (← links)
• On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
• A metaheuristic approach to the dominating tree problem (Q1677304) (← links)
• Parameterized measure \& conquer for problems with no small kernels (Q1759684) (← links)
• On approximation of dominating tree in wireless sensor networks (Q1958639) (← links)
• Approximation algorithms for minimum weight connected 3-path vertex cover (Q2008557) (← links)
• New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← links)
• Approximation hardness of edge dominating set problems (Q2369972) (← links)
• Approximability of the capacitated \(b\)-edge dominating set problem (Q2456372) (← links)
• A primal-dual method for approximating tree cover with two weights (Q2465937) (← links)
• Linear time algorithms for generalized edge dominating set problems (Q2480902) (← links)
• A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs (Q2512658) (← links)
• Decomposition algorithms for solving the minimum weight maximal matching problem (Q2811314) (← links)
• (Q4472438) (← links)
• Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination (Q5041206) (← links)
• Computing and Combinatorics (Q5716997) (← links)
• Upper and lower bounds on approximating weighted mixed domination (Q5918569) (← links)