Pages that link to "Item:Q1184733"
From MaRDI portal
The following pages link to On the complexity of approximating the independent set problem (Q1184733):
Displayed 17 items.
- Approximate solution of NP optimization problems (Q672315) (← links)
- Complexities of efficient solutions of rectilinear polygon cover problems (Q676264) (← links)
- On approximating the longest path in a graph (Q679451) (← links)
- On approximating four covering and packing problems (Q1021577) (← links)
- On the hardness of approximating max-satisfy (Q1045886) (← links)
- Optimization, approximation, and complexity classes (Q1186548) (← links)
- Approximating maximum independent sets by excluding subgraphs (Q1196452) (← links)
- Zero knowledge and the chromatic number (Q1276168) (← links)
- The complexity and approximability of finding maximum feasible subsystems of linear relations (Q1367542) (← links)
- Randomized graph products, chromatic numbers, and the Lovász \(\vartheta\)-function (Q1375058) (← links)
- Approximating the independence number via the \(\vartheta\)-function (Q1380939) (← links)
- Clique is hard to approximate within \(n^{1-\epsilon}\) (Q1588908) (← links)
- Derandomized graph products (Q1842777) (← links)
- On constructing an optimal consensus clustering from multiple clusterings (Q2380012) (← links)
- Inapproximability results for the lateral gene transfer problem (Q2479568) (← links)
- Expander graphs and their applications (Q3514498) (← links)
- Hardness and methods to solve CLIQUE (Q5959359) (← links)