Pages that link to "Item:Q392028"

The following pages link to A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028):

Displaying 9 items.

• Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
• Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
• The many facets of upper domination (Q1704853) (← links)
• Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
• New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← links)
• Invited talks (Q2692717) (← links)
• On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
• Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063) (← links)
• Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427) (← links)