The following pages link to (Q2754129):
Displaying 10 items.
- The clique problem in ray intersection graphs (Q377488) (← links)
- Hyperbolic set covering problems with competing ground-set elements (Q715069) (← links)
- Inapproximability results for equations over infinite groups (Q974745) (← links)
- Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596) (← links)
- The consensus string problem and the complexity of comparing hidden Markov models. (Q1872725) (← links)
- Towards optimal lower bounds for clique and chromatic number. (Q1874411) (← links)
- On the approximability of clique and related maximization problems (Q1877696) (← links)
- Fast Heuristics and Approximation Algorithms (Q5050148) (← links)
- The Bipartite QUBO (Q5050150) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
