Pages that link to "Item:Q5096160"
From MaRDI portal
The following pages link to On the complexity of approximating the independent set problem (Q5096160):
Displaying 6 items.
- Maximum bounded 3-dimensional matching is MAX SNP-complete (Q922700) (← links)
- An exact algorithm for the maximum clique problem (Q922964) (← links)
- A note on the approximation of the MAX CLIQUE problem (Q1183423) (← links)
- Recent results in hardness of approximation (Q5054764) (← links)
- Approximating maximum independent sets by excluding subgraphs (Q5056088) (← links)
- On the approximability of the maximum common subgraph problem (Q5096796) (← links)
