Name
Title | ||
|---|---|---|
On the Hardness of Approximating Some Optimization Problems That Are Supposedly Easier Than MAX CLIQUE |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1017/S0963548300001553 | Combinatorics, Probability & Computing |
Keywords | Field | DocType |
optimization problem,hardness of approximation | Discrete mathematics,Combinatorics,Clique,Hardness of approximation,Optimization problem,Mathematics | Journal |
Volume | Issue | Citations |
4 | 02 | 0 |
PageRank | References | Authors |
0.34 | 6 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oleg Verbitsky | 1 | 191 | 27.50 |