Pages that link to "Item:Q899583"
From MaRDI portal
The following pages link to Data reductions and combinatorial bounds for improved approximation algorithms (Q899583):
Displaying 9 items.
- 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)
- Knapsack problems: a parameterized point of view (Q2419116) (← links)
- Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
- Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063) (← links)
- Data reduction and exact algorithms for clique cover (Q5406188) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6043174) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6547209) (← links)
