Pages that link to "Item:Q1183423"
From MaRDI portal
The following pages link to A note on the approximation of the MAX CLIQUE problem (Q1183423):
Displaying 15 items.
- Approximate solution of NP optimization problems (Q672315) (← links)
- A note on the descriptive complexity of maximization problems (Q685495) (← links)
- On the complexity of the shortest-path broadcast problem (Q896659) (← links)
- Quantifiers and approximation (Q1208413) (← links)
- The maximum clique problem (Q1318271) (← links)
- Finding optimal subgraphs by local search (Q1392027) (← links)
- Clique is hard to approximate within \(n^{1-\epsilon}\) (Q1588908) (← links)
- Correction to: ``Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts'' (Q1634803) (← links)
- Derandomized graph products (Q1842777) (← links)
- Modelling competitive Hopfield networks for the maximum clique problem (Q1870811) (← links)
- On the approximability of clique and related maximization problems (Q1877696) (← links)
- Approximation and inapproximability results for maximum clique of disc graphs in high dimensions (Q2380046) (← links)
- Extended and discretized formulations for the maximum clique problem (Q2655650) (← links)
- Maximum cut-clique problem: ILS heuristics and a data analysis application (Q2806429) (← links)
- (Q3112179) (← links)