Pages that link to "Item:Q3058690"

The following pages link to Enumerate and Measure: Improving Parameter Budget Management (Q3058690):

Displaying 14 items.

• Parameterized edge dominating set in graphs with degree bounded by 3 (Q388085) (← links)
• New parameterized algorithms for the edge dominating set problem (Q392035) (← links)
• A refined exact algorithm for edge dominating set (Q477194) (← links)
• On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
• Parameterized measure \& conquer for problems with no small kernels (Q1759684) (← links)
• Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
• Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
• New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← links)
• A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
• Contracting graphs to paths and trees (Q2441588) (← links)
• Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers (Q2803828) (← links)
• A Multivariate Approach for Weighted FPT Algorithms (Q3452855) (← links)
• New Results on Directed Edge Dominating Set (Q5005171) (← links)
• On Approximating (Connected) 2-Edge Dominating Set by a Tree (Q5740184) (← links)