Pages that link to "Item:Q989538"
From MaRDI portal
The following pages link to Exponential-time approximation of weighted set cover (Q989538):
Displayed 9 items.
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- Exponential approximation schemata for some network design problems (Q396669) (← links)
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
- Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187) (← links)
- Algorithms for dominating clique problems (Q1758169) (← links)
- Improved approximation bounds for the minimum rainbow subgraph problem (Q1944047) (← links)
- Capacitated domination faster than \(O(2^n)\) (Q1944213) (← links)
- Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
- An Exponential Time 2-Approximation Algorithm for Bandwidth (Q3656860) (← links)