Class information for: |
Basic class information |
| ID | Publications | Average number of references |
Avg. shr. active ref. in WoS |
|---|---|---|---|
| 12641 | 829 | 19.9 | 40% |
Classes in level above (level 2) |
| ID, lev. above |
Publications | Label for level above |
|---|---|---|
| 774 | 11629 | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS//COMPUTATIONAL GEOMETRY//APPROXIMATION ALGORITHMS |
Terms with highest relevance score |
| Rank | Term | Type of term | Relevance score (tfidf) |
Class's shr. of term's tot. occurrences |
Shr. of publ. in class containing term |
Num. of publ. in class |
|---|---|---|---|---|---|---|
| 1 | VERTEX COVER | Author keyword | 22 | 31% | 7% | 59 |
| 2 | DIFFERENTIAL RATIO | Author keyword | 15 | 88% | 1% | 7 |
| 3 | PRIORITY ALGORITHMS | Author keyword | 12 | 86% | 1% | 6 |
| 4 | SET COVER | Author keyword | 11 | 28% | 4% | 33 |
| 5 | LOCAL RATIO | Author keyword | 8 | 52% | 1% | 11 |
| 6 | LOCAL RATIO TECHNIQUE | Author keyword | 7 | 64% | 1% | 7 |
| 7 | CAPACITATED COVERING | Author keyword | 6 | 71% | 1% | 5 |
| 8 | MAXIMUM TRIANGLE PACKING | Author keyword | 6 | 71% | 1% | 5 |
| 9 | LAMSADE | Address | 6 | 12% | 5% | 45 |
| 10 | DEFICIENT SIPHONS | Author keyword | 6 | 100% | 0% | 4 |
Web of Science journal categories |
Author Key Words |
| Rank | Web of Science journal category | Relevance score (tfidf) |
Class's shr. of term's tot. occurrences |
Shr. of publ. in class containing term |
Num. of publ. in class |
LCSH search | Wikipedia search |
|---|---|---|---|---|---|---|---|
| 1 | VERTEX COVER | 22 | 31% | 7% | 59 | Search VERTEX+COVER | Search VERTEX+COVER |
| 2 | DIFFERENTIAL RATIO | 15 | 88% | 1% | 7 | Search DIFFERENTIAL+RATIO | Search DIFFERENTIAL+RATIO |
| 3 | PRIORITY ALGORITHMS | 12 | 86% | 1% | 6 | Search PRIORITY+ALGORITHMS | Search PRIORITY+ALGORITHMS |
| 4 | SET COVER | 11 | 28% | 4% | 33 | Search SET+COVER | Search SET+COVER |
| 5 | LOCAL RATIO | 8 | 52% | 1% | 11 | Search LOCAL+RATIO | Search LOCAL+RATIO |
| 6 | LOCAL RATIO TECHNIQUE | 7 | 64% | 1% | 7 | Search LOCAL+RATIO+TECHNIQUE | Search LOCAL+RATIO+TECHNIQUE |
| 7 | CAPACITATED COVERING | 6 | 71% | 1% | 5 | Search CAPACITATED+COVERING | Search CAPACITATED+COVERING |
| 8 | MAXIMUM TRIANGLE PACKING | 6 | 71% | 1% | 5 | Search MAXIMUM+TRIANGLE+PACKING | Search MAXIMUM+TRIANGLE+PACKING |
| 9 | DEFICIENT SIPHONS | 6 | 100% | 0% | 4 | Search DEFICIENT+SIPHONS | Search DEFICIENT+SIPHONS |
| 10 | DISSOCIATION NUMBER | 6 | 100% | 0% | 4 | Search DISSOCIATION+NUMBER | Search DISSOCIATION+NUMBER |
Key Words Plus |
| Rank | Web of Science journal category | Relevance score (tfidf) |
Class's shr. of term's tot. occurrences |
Shr. of publ. in class containing term |
Num. of publ. in class |
|---|---|---|---|---|---|
| 1 | PERFORMANCE GUARANTEE | 16 | 58% | 2% | 19 |
| 2 | NP OPTIMIZATION PROBLEMS | 13 | 80% | 1% | 8 |
| 3 | LARGE HIDDEN CLIQUE | 12 | 54% | 2% | 15 |
| 4 | SEMIRANDOM GRAPH | 10 | 73% | 1% | 8 |
| 5 | PRIORITY ALGORITHMS | 8 | 60% | 1% | 9 |
| 6 | VERTEX COVER | 8 | 20% | 4% | 36 |
| 7 | LOCAL RATIO | 7 | 67% | 1% | 6 |
| 8 | MINIMUM SATISFIABILITY PROBLEM | 6 | 100% | 0% | 4 |
| 9 | P 3 PROBLEM | 4 | 75% | 0% | 3 |
| 10 | POLYNOMIAL EXPECTED TIME | 4 | 75% | 0% | 3 |
Journals |
Reviews |
| Title | Publ. year | Cit. | Active references |
% act. ref. to same field |
|---|---|---|---|---|
| Reductions, completeness and the hardness of approximability | 2006 | 6 | 13 | 100% |
| Algorithmic theory of random graphs | 1997 | 60 | 84 | 12% |
Address terms |
| Rank | Address term | Relevance score (tfidf) |
Class's shr. of term's tot. occurrences |
Shr. of publ. in class containing term |
Num. of publ. in class |
|---|---|---|---|---|---|
| 1 | LAMSADE | 6 | 12% | 5.4% | 45 |
| 2 | UMR 7024 | 3 | 30% | 1.1% | 9 |
| 3 | CAESAREA ROTH ILD | 1 | 13% | 0.7% | 6 |
| 4 | CHAIR THEORET COMP SCI INFORMAT SECUR | 1 | 50% | 0.1% | 1 |
| 5 | FAK INFORAMT | 1 | 50% | 0.1% | 1 |
| 6 | IBTS | 1 | 50% | 0.1% | 1 |
| 7 | NEUKOM | 1 | 50% | 0.1% | 1 |
| 8 | DIPARTIMENTO MATEMAT INFORMAT DIMI | 0 | 33% | 0.1% | 1 |
| 9 | IBISC CNRS | 0 | 33% | 0.1% | 1 |
| 10 | INFORMAT COMMUN TECHNOL S | 0 | 33% | 0.1% | 1 |
Related classes at same level (level 1) |
| Rank | Relatedness score | Related classes |
|---|---|---|
| 1 | 0.0000288117 | PROPERTY TESTING//PROBABILISTICALLY CHECKABLE PROOFS//SUBLINEAR ALGORITHMS |
| 2 | 0.0000223171 | K MEDIAN//BROADCAST DOMINATION//FACILITY LOCATION PROBLEM |
| 3 | 0.0000209867 | APPROXIMATION ALGORITHMS//RANGE ASSIGNMENT//MINIMUM ENERGY BROADCAST |
| 4 | 0.0000177044 | PATH COLORING//K SPLITTABLE FLOW//PARTITIONED OPTICAL PASSIVE STARS NETWORK |
| 5 | 0.0000173656 | STRONG CHROMATIC INDEX//INCIDENCE COLORING//INDUCED MATCHING |
| 6 | 0.0000157573 | TREE WIDTH//PARAMETERIZED COMPLEXITY//PATHWIDTH |
| 7 | 0.0000147404 | B CHROMATIC NUMBER//ACHROMATIC NUMBER//B COLORING |
| 8 | 0.0000144370 | CLIQUE RELAXATIONS//MAXIMUM CLIQUE PROBLEM//MAXIMUM CLIQUE |
| 9 | 0.0000125948 | FIXED JOB SCHEDULING//INTERVAL SCHEDULING//K TRACK ASSIGNMENT |
| 10 | 0.0000104777 | COMPLETELY POSITIVE MATRICES//COPOSITIVE PROGRAMMING//MAX CUT PROBLEM |