Pages that link to "Item:Q1019736"
From MaRDI portal
The following pages link to Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736):
Displayed 5 items.
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
- Approximation of min coloring by moderately exponential algorithms (Q989534) (← links)
- Exponential-time approximation of weighted set cover (Q989538) (← links)
- Algorithms for dominating clique problems (Q1758169) (← links)
- Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms (Q3183480) (← links)