Pages that link to "Item:Q3060750"
From MaRDI portal
The following pages link to Combining Two Worlds: Parameterised Approximation for Vertex Cover (Q3060750):
Displaying 7 items.
- Parameterized approximation algorithms for packing problems (Q313963) (← links)
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- One for the price of two: a unified approach for approximating covering problems (Q1977131) (← links)
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics (Q2891355) (← links)
- Super-polynomial approximation branching algorithms (Q2954364) (← links)
- Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation (Q4596147) (← links)
