Class information for:
Level 1: APPROXIMATION ALGORITHMS//EDGE CONNECTIVITY//CONNECTIVITY AUGMENTATION

Basic class information
Class id #P Avg. number of
references		 Database coverage
of references
9133 1185 19.8 44%


Bar chart of Publication_year

Last years might be incomplete

Hierarchy of classes
The table includes all classes above and classes immediately below the current class.


Cluster id Level Cluster label #P
9 4 COMPUTER SCIENCE, THEORY & METHODS//COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE//COMPUTER SCIENCE, INFORMATION SYSTEMS 1247339
75 3       OPERATIONS RESEARCH & MANAGEMENT SCIENCE//ENGINEERING, INDUSTRIAL//EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 81966
998 2             APPROXIMATION ALGORITHMS//MATHEMATICAL PROGRAMMING//OPERATIONS RESEARCH & MANAGEMENT SCIENCE 10443
9133 1                   APPROXIMATION ALGORITHMS//EDGE CONNECTIVITY//CONNECTIVITY AUGMENTATION 1185

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 688796 25% 9% 296
2 EDGE CONNECTIVITY authKW 467115 5% 29% 62
3 CONNECTIVITY AUGMENTATION authKW 448110 2% 87% 20
4 HOP CONSTRAINTS authKW 437034 2% 81% 21
5 EDGE SPLITTING authKW 280564 1% 78% 14
6 STEINER TREE authKW 223885 5% 16% 55
7 EDGE CONNECTIVITY AUGMENTATION authKW 208708 1% 90% 9
8 GRAPH CONNECTIVITY authKW 204884 2% 31% 26
9 SURVIVABLE NETWORK DESIGN authKW 201240 1% 46% 17
10 NETWORK DESIGN authKW 198040 7% 9% 87

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 Operations Research & Management Science 15722 26% 0% 311
2 Mathematics, Applied 14970 45% 0% 529
3 Computer Science, Theory & Methods 14841 31% 0% 367
4 Computer Science, Software Engineering 5489 16% 0% 190
5 Computer Science, Hardware & Architecture 3613 10% 0% 119
6 Computer Science, Information Systems 2067 11% 0% 134
7 Logic 1964 3% 0% 34
8 Mathematics 560 11% 0% 128
9 Computer Science, Interdisciplinary Applications 537 6% 0% 75
10 Engineering, Industrial 110 2% 0% 23

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 LEHRSTUHL INFORMAT ALGORITHMEN KOMPLEXITAT 1 77300 0% 100% 3
2 CHAIR ALGORITHM ENGN 11 51533 0% 100% 2
3 MTA ELTE EGERVARY GRP 42155 1% 27% 6
4 COMB OPT 38647 0% 50% 3
5 LEHRSTUHL ALGORITHMEN KOMPLEXITAT 34354 0% 67% 2
6 POMS 34354 0% 67% 2
7 THEORET TECH COMP SCI 34354 0% 67% 2
8 LIMOS 32502 2% 5% 24
9 PL MATH PHYS 27065 3% 3% 38
10 ARTEMENT COMP SCI 25767 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 NETWORKS 50518 5% 3% 58
2 ACM TRANSACTIONS ON ALGORITHMS 40085 2% 6% 26
3 JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC 35865 3% 4% 34
4 MATHEMATICAL PROGRAMMING 31757 5% 2% 62
5 ALGORITHMICA 31600 4% 2% 53
6 JOURNAL OF COMBINATORIAL OPTIMIZATION 31053 3% 3% 39
7 SIAM JOURNAL ON DISCRETE MATHEMATICS 28965 4% 2% 48
8 SIAM JOURNAL ON COMPUTING 25983 5% 2% 54
9 DISCRETE APPLIED MATHEMATICS 23938 7% 1% 78
10 OPERATIONS RESEARCH LETTERS 20419 4% 2% 47

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 688796 25% 9% 296 Search APPROXIMATION+ALGORITHMS Search APPROXIMATION+ALGORITHMS
2 EDGE CONNECTIVITY 467115 5% 29% 62 Search EDGE+CONNECTIVITY Search EDGE+CONNECTIVITY
3 CONNECTIVITY AUGMENTATION 448110 2% 87% 20 Search CONNECTIVITY+AUGMENTATION Search CONNECTIVITY+AUGMENTATION
4 HOP CONSTRAINTS 437034 2% 81% 21 Search HOP+CONSTRAINTS Search HOP+CONSTRAINTS
5 EDGE SPLITTING 280564 1% 78% 14 Search EDGE+SPLITTING Search EDGE+SPLITTING
6 STEINER TREE 223885 5% 16% 55 Search STEINER+TREE Search STEINER+TREE
7 EDGE CONNECTIVITY AUGMENTATION 208708 1% 90% 9 Search EDGE+CONNECTIVITY+AUGMENTATION Search EDGE+CONNECTIVITY+AUGMENTATION
8 GRAPH CONNECTIVITY 204884 2% 31% 26 Search GRAPH+CONNECTIVITY Search GRAPH+CONNECTIVITY
9 SURVIVABLE NETWORK DESIGN 201240 1% 46% 17 Search SURVIVABLE+NETWORK+DESIGN Search SURVIVABLE+NETWORK+DESIGN
10 NETWORK DESIGN 198040 7% 9% 87 Search NETWORK+DESIGN Search NETWORK+DESIGN

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 KERIVIN, H , MAHJOUB, AR , (2005) DESIGN OF SURVIVABLE NETWORKS: A SURVEY.NETWORKS. VOL. 46. ISSUE 1. P. 1 -21 57 81% 89
2 NAGAMOCHI, H , IBARAKI, T , (2002) GRAPH CONNECTIVITY AND ITS AUGMENTATION: APPLICATIONS OF MA ORDERINGS.DISCRETE APPLIED MATHEMATICS. VOL. 123. ISSUE 1-3. P. 447-472 48 91% 24
3 FUKUNAGA, T , NUTOV, Z , RAVI, R , (2015) ITERATIVE ROUNDING APPROXIMATION ALGORITHMS FOR DEGREE-BOUNDED NODE-CONNECTIVITY NETWORK DESIGN.SIAM JOURNAL ON COMPUTING. VOL. 44. ISSUE 5. P. 1202 -1229 27 100% 1
4 DIARRASSOUBA, I , GABREL, V , MAHJOUB, AR , GOUVEIA, L , PESNEAU, P , (2016) INTEGER PROGRAMMING FORMULATIONS FOR THE K-EDGE-CONNECTED 3-HOP-CONSTRAINED NETWORK DESIGN PROBLEM.NETWORKS. VOL. 67. ISSUE 2. P. 148 -169 24 100% 1
5 NAGAMOCHI, H , (2000) RECENT DEVELOPMENT OF GRAPH CONNECTIVITY AUGMENTATION ALGORITHMS.IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS. VOL. E83D. ISSUE 3. P. 372 -383 40 85% 6
6 BENDALI, F , DIARRASSOUBA, I , MAHJOUB, AR , MAILFERT, J , (2010) THE K EDGE-DISJOINT 3-HOP-CONSTRAINED PATHS POLYTOPE.DISCRETE OPTIMIZATION. VOL. 7. ISSUE 4. P. 222-233 24 100% 5
7 LAEKHANUKIT, B , FAKCHAROENPHOL, J , (2012) AN O(LOG(2) K)-APPROXIMATION ALGORITHM FOR THE K-VERTEX CONNECTED SPANNING SUBGRAPH PROBLEM.SIAM JOURNAL ON COMPUTING. VOL. 41. ISSUE 5. P. 1095 -1109 23 96% 6
8 MAHJOUB, AR , PESNEAU, P , (2008) ON THE STEINER 2-EDGE CONNECTED SUBGRAPH POLYTOPE.RAIRO-OPERATIONS RESEARCH. VOL. 42. ISSUE 3. P. 259 -283 22 100% 5
9 CHAN, YH , FUNG, WS , LAU, LC , YUNG, CK , (2011) DEGREE BOUNDED NETWORK DESIGN WITH METRIC COSTS.SIAM JOURNAL ON COMPUTING. VOL. 40. ISSUE 4. P. 953 -980 21 91% 5
10 CHERIYAN, J , VETTA, A , (2007) APPROXIMATION ALGORITHMS FOR NETWORK DESIGN WITH METRIC COSTS.SIAM JOURNAL ON DISCRETE MATHEMATICS. VOL. 21. ISSUE 3. P. 612 -636 21 100% 11

Classes with closest relation at Level 1


Rank Class id link
1 21649 K MEDIAN//APPROXIMATION ALGORITHMS//FACILITY LOCATION PROBLEM
2 14302 BASE POLYHEDRON//VALUATED MATROID//SUBMODULAR FUNCTION
3 12449 APPROXIMATION ALGORITHMS//VERTEX COVER//SET COVER
4 21059 TOPOLOGY CONTROL//MINIMUM ENERGY BROADCAST//WIRELESS AD HOC NETWORKS
5 33372 LABELED MATCHING//TIME MINIMIZING ASSIGNMENT PROBLEM//LABELED CORRELATION CLUSTERING
6 17596 BANDWIDTH PACKING//CHAIR SYST COMP NETWORKS//DEGREE CONSTRAINED MINIMUM SPANNING TREE
7 8995 MULTICAST ROUTING//QOS ROUTING//MULTICAST
8 16907 TRAVELING SALESMAN PROBLEM//DOMINATION ANALYSIS//GENERALIZED TRAVELING SALESMAN PROBLEM
9 17794 STEINER TREE//GLOBAL ROUTING//STEINER MINIMAL TREE
10 13976 SPARSEST CUT//LIPSCHITZ FREE SPACE//METRIC EMBEDDING

Go to start page