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 18 items.
- A note on anti-coordination and social interactions (Q386417) (← links)
- Approximation algorithm for DNF under distributions with limited independence (Q675867) (← links)
- Approximating the minimum maximal independence number (Q685520) (← links)
- 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)
- On the complexity of approximating the independent set problem (Q1184733) (← links)
- Faster exponential-time algorithms for approximately counting independent sets (Q2235762) (← links)
- On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
- Resource bounds and subproblem independence (Q2581008) (← links)
- A fine-grained analysis of a simple independent set algorithm (Q2920136) (← links)
- Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms (Q4608072) (← links)
- (Q4938668) (← 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)
- The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem (Q5249786) (← links)
- Expanding operators for the independent set problem (Q5263812) (← links)