Class information for: |
Basic class information |
Class id | #P | Avg. number of references |
Database coverage of references |
---|---|---|---|
12449 | 905 | 21.6 | 43% |
Hierarchy of classes |
The table includes all classes above and classes immediately below the current class. |
Terms with highest relevance score |
rank | Term | termType | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|---|
1 | APPROXIMATION ALGORITHMS | authKW | 573346 | 26% | 7% | 236 |
2 | VERTEX COVER | authKW | 463379 | 6% | 27% | 50 |
3 | SET COVER | authKW | 298641 | 3% | 31% | 29 |
4 | PROBABILISTICALLY CHECKABLE PROOFS | authKW | 295458 | 2% | 52% | 17 |
5 | LOCAL RATIO | authKW | 269906 | 1% | 67% | 12 |
6 | LOCALLY TESTABLE CODES | authKW | 255146 | 1% | 69% | 11 |
7 | PRIORITY ALGORITHMS | authKW | 206651 | 1% | 88% | 7 |
8 | UNIQUE GAMES CONJECTURE | authKW | 179937 | 1% | 67% | 8 |
9 | EDGE DOMINATING SET | authKW | 177486 | 1% | 48% | 11 |
10 | HARDNESS OF APPROXIMATION | authKW | 164655 | 3% | 20% | 24 |
Web of Science journal categories |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|
1 | Computer Science, Theory & Methods | 27903 | 48% | 0% | 436 |
2 | Mathematics, Applied | 9476 | 41% | 0% | 369 |
3 | Computer Science, Software Engineering | 4186 | 16% | 0% | 145 |
4 | Computer Science, Information Systems | 3475 | 16% | 0% | 149 |
5 | Logic | 2293 | 4% | 0% | 32 |
6 | Operations Research & Management Science | 1851 | 11% | 0% | 96 |
7 | Computer Science, Hardware & Architecture | 1083 | 6% | 0% | 58 |
8 | Mathematics | 920 | 15% | 0% | 136 |
9 | Computer Science, Interdisciplinary Applications | 149 | 4% | 0% | 37 |
10 | Computer Science, Artificial Intelligence | 97 | 3% | 0% | 30 |
Address terms |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|
1 | LAMSADE | 101387 | 4% | 8% | 36 |
2 | UMR 7024 | 55097 | 1% | 23% | 7 |
3 | NUMER ANAL COMP SCI | 46219 | 2% | 6% | 22 |
4 | ALGORITHMS BIOL STRUCT PROJECT TEAM | 33739 | 0% | 100% | 1 |
5 | BASIC PL SIMULAT SCI D 2 | 33739 | 0% | 100% | 1 |
6 | CESAREA ROTH ILD | 33739 | 0% | 100% | 1 |
7 | CS COMP | 33739 | 0% | 100% | 1 |
8 | DIMACS AUTOMAT COMPUTAT | 33739 | 0% | 100% | 1 |
9 | E SCI UNIT | 33739 | 0% | 100% | 1 |
10 | FOR ERGRP ALGORITHMEN | 33739 | 0% | 100% | 1 |
Journals |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|
1 | COMPUTATIONAL COMPLEXITY | 33092 | 2% | 5% | 18 |
2 | SIAM JOURNAL ON COMPUTING | 31575 | 6% | 2% | 52 |
3 | JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC | 29617 | 3% | 3% | 27 |
4 | INFORMATION PROCESSING LETTERS | 26008 | 8% | 1% | 70 |
5 | ALGORITHMICA | 24762 | 5% | 2% | 41 |
6 | RANDOM STRUCTURES & ALGORITHMS | 20969 | 3% | 2% | 27 |
7 | THEORETICAL COMPUTER SCIENCE | 13235 | 7% | 1% | 65 |
8 | LECTURE NOTES IN COMPUTER SCIENCE | 11411 | 19% | 0% | 174 |
9 | ACM TRANSACTIONS ON ALGORITHMS | 11171 | 1% | 3% | 12 |
10 | JOURNAL OF COMBINATORIAL OPTIMIZATION | 10680 | 2% | 2% | 20 |
Author Key Words |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
LCSH search | Wikipedia search |
---|---|---|---|---|---|---|---|
1 | APPROXIMATION ALGORITHMS | 573346 | 26% | 7% | 236 | Search APPROXIMATION+ALGORITHMS | Search APPROXIMATION+ALGORITHMS |
2 | VERTEX COVER | 463379 | 6% | 27% | 50 | Search VERTEX+COVER | Search VERTEX+COVER |
3 | SET COVER | 298641 | 3% | 31% | 29 | Search SET+COVER | Search SET+COVER |
4 | PROBABILISTICALLY CHECKABLE PROOFS | 295458 | 2% | 52% | 17 | Search PROBABILISTICALLY+CHECKABLE+PROOFS | Search PROBABILISTICALLY+CHECKABLE+PROOFS |
5 | LOCAL RATIO | 269906 | 1% | 67% | 12 | Search LOCAL+RATIO | Search LOCAL+RATIO |
6 | LOCALLY TESTABLE CODES | 255146 | 1% | 69% | 11 | Search LOCALLY+TESTABLE+CODES | Search LOCALLY+TESTABLE+CODES |
7 | PRIORITY ALGORITHMS | 206651 | 1% | 88% | 7 | Search PRIORITY+ALGORITHMS | Search PRIORITY+ALGORITHMS |
8 | UNIQUE GAMES CONJECTURE | 179937 | 1% | 67% | 8 | Search UNIQUE+GAMES+CONJECTURE | Search UNIQUE+GAMES+CONJECTURE |
9 | EDGE DOMINATING SET | 177486 | 1% | 48% | 11 | Search EDGE+DOMINATING+SET | Search EDGE+DOMINATING+SET |
10 | HARDNESS OF APPROXIMATION | 164655 | 3% | 20% | 24 | Search HARDNESS+OF+APPROXIMATION | Search HARDNESS+OF+APPROXIMATION |
Core articles |
The table includes core articles in the class. The following variables is taken into account for the relevance score of an article in a cluster c: (1) Number of references referring to publications in the class. (2) Share of total number of active references referring to publications in the class. (3) Age of the article. New articles get higher score than old articles. (4) Citation rate, normalized to year. |
Rank | Reference | # ref. in cl. |
Shr. of ref. in cl. |
Citations |
---|---|---|---|---|
1 | CHAN, SO , (2016) APPROXIMATION RESISTANCE FROM PAIRWISE-INDEPENDENT SUBGROUPS.JOURNAL OF THE ACM. VOL. 63. ISSUE 3. P. - | 22 | 67% | 0 |
2 | COJA-OGHLAN, A , (2007) COLOURING SEMIRANDOM GRAPHS.COMBINATORICS PROBABILITY & COMPUTING. VOL. 16. ISSUE 4. P. 515 -552 | 18 | 82% | 3 |
3 | HASTAD, J , (2001) SOME OPTIMAL INAPPROXIMABILITY RESULTS.JOURNAL OF THE ACM. VOL. 48. ISSUE 4. P. 798 -859 | 15 | 75% | 446 |
4 | DINUR, I , HARSHA, P , (2013) COMPOSITION OF LOW-ERROR 2-QUERY PCPS USING DECODABLE PCPS.SIAM JOURNAL ON COMPUTING. VOL. 42. ISSUE 6. P. 2452-2486 | 15 | 83% | 2 |
5 | BAR-YEHUDA, R , FLYSHER, G , MESTRE, J , RAWITZ, D , (2010) APPROXIMATION OF PARTIAL CAPACITATED VERTEX COVER.SIAM JOURNAL ON DISCRETE MATHEMATICS. VOL. 24. ISSUE 4. P. 1441 -1469 | 15 | 83% | 0 |
6 | FEIGE, U , OFEK, E , (2008) FINDING A MAXIMUM INDEPENDENT SET IN A SPARSE RANDOM GRAPH.SIAM JOURNAL ON DISCRETE MATHEMATICS. VOL. 22. ISSUE 2. P. 693 -718 | 13 | 100% | 1 |
7 | BOYAR, J , LARSEN, KS , MIRMOHAMMADI, N , BORODIN, A , (2010) PRIORITY ALGORITHMS FOR GRAPH OPTIMIZATION PROBLEMS.THEORETICAL COMPUTER SCIENCE. VOL. 411. ISSUE 1. P. 239 -258 | 14 | 88% | 3 |
8 | AUSIELLO, G , BAZGAN, C , DEMANGE, M , PASCHOS, VT , (2005) COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES.INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE. VOL. 16. ISSUE 6. P. 1267 -1295 | 15 | 94% | 3 |
9 | GURUSWAMI, V , KHANNA, S , (2004) ON THE HARDNESS OF 4-COLORING A 3-COLORABLE GRAPH.SIAM JOURNAL ON DISCRETE MATHEMATICS. VOL. 18. ISSUE 1. P. 30 -40 | 15 | 94% | 10 |
10 | KOUFOGIANNAKIS, C , YOUNG, NE , (2013) GREEDY DELTA-APPROXIMATION ALGORITHM FOR COVERING WITH ARBITRARY CONSTRAINTS AND SUBMODULAR COST.ALGORITHMICA. VOL. 66. ISSUE 1. P. 113-152 | 19 | 58% | 5 |
Classes with closest relation at Level 1 |