Class information for:
Level 1: APPROXIMATION ALGORITHMS//RANGE ASSIGNMENT//MINIMUM ENERGY BROADCAST

Basic class information
ID Publications Average number
of references		 Avg. shr. active
ref. in WoS
11525 909 19.8 40%


Bar chart of Publication_year

Last years might be incomplete

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 APPROXIMATION ALGORITHMS Author keyword 23 10% 24% 215
2 RANGE ASSIGNMENT Author keyword 9 64% 1% 9
3 MINIMUM ENERGY BROADCAST Author keyword 7 67% 1% 6
4 BOTTLENECK STEINER TREE Author keyword 6 80% 0% 4
5 STEINER FOREST Author keyword 6 71% 1% 5
6 INTEGRALITY RATIO Author keyword 6 100% 0% 4
7 MAXIMUM SCATTER TSP Author keyword 6 100% 0% 4
8 RELAXED TRIANGLE INEQUALITY Author keyword 6 100% 0% 4
9 SURVIVABLE NETWORK DESIGN PROBLEM Author keyword 6 100% 0% 4
10 BROADCAST ROUTING Author keyword 4 47% 1% 7

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 APPROXIMATION ALGORITHMS 23 10% 24% 215 Search APPROXIMATION+ALGORITHMS Search APPROXIMATION+ALGORITHMS
2 RANGE ASSIGNMENT 9 64% 1% 9 Search RANGE+ASSIGNMENT Search RANGE+ASSIGNMENT
3 MINIMUM ENERGY BROADCAST 7 67% 1% 6 Search MINIMUM+ENERGY+BROADCAST Search MINIMUM+ENERGY+BROADCAST
4 BOTTLENECK STEINER TREE 6 80% 0% 4 Search BOTTLENECK+STEINER+TREE Search BOTTLENECK+STEINER+TREE
5 STEINER FOREST 6 71% 1% 5 Search STEINER+FOREST Search STEINER+FOREST
6 INTEGRALITY RATIO 6 100% 0% 4 Search INTEGRALITY+RATIO Search INTEGRALITY+RATIO
7 MAXIMUM SCATTER TSP 6 100% 0% 4 Search MAXIMUM+SCATTER+TSP Search MAXIMUM+SCATTER+TSP
8 RELAXED TRIANGLE INEQUALITY 6 100% 0% 4 Search RELAXED+TRIANGLE+INEQUALITY Search RELAXED+TRIANGLE+INEQUALITY
9 SURVIVABLE NETWORK DESIGN PROBLEM 6 100% 0% 4 Search SURVIVABLE+NETWORK+DESIGN+PROBLEM Search SURVIVABLE+NETWORK+DESIGN+PROBLEM
10 BROADCAST ROUTING 4 47% 1% 7 Search BROADCAST+ROUTING Search BROADCAST+ROUTING

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 GRAPH AUGMENTATION 18 65% 2% 17
2 EFFICIENT BROADCAST 17 79% 1% 11
3 PERFORMANCE GUARANTEES 14 57% 2% 16
4 TSP 8 18% 5% 42
5 RANGE ASSIGNMENT 7 53% 1% 10
6 GEOMETRIC PROBLEMS 7 41% 1% 13
7 BOUNDED EDGE LENGTH 7 67% 1% 6
8 K MST PROBLEM 7 67% 1% 6
9 DEGREE SPANNING TREES 6 80% 0% 4
10 MSTS 6 80% 0% 4

Journals

Reviews


Title Publ. year Cit. Active
references		 % act. ref.
to same field
Energy-aware multicasting in wireless ad hoc networks: A survey and discussion 2007 43 14 64%
Multicasting in cognitive radio networks: Algorithms, techniques and protocols 2014 1 51 12%
Some applications of the clustered travelling salesman problem 2002 11 19 11%

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 LEHRSTUHL INFORMAT ALGORITHMEN KOMPLEXITAT 1 3 100% 0.3% 3
2 COMB OPT 3 60% 0.3% 3
3 LEHRSTUHL ALGORITHMEN KOMPLEXITAT 2 67% 0.2% 2
4 MASCOTTE PROJECT 1 16% 0.4% 4
5 COMPLEX SYST ANAL OPTIMIZAT 1 50% 0.1% 1
6 INFORMAT ELECT ENGINEER 1 50% 0.1% 1
7 INTERNETWORK 1 50% 0.1% 1
8 LEHRSTUHL THEORET INFORMAT 2 1 50% 0.1% 1
9 ZENTRUM ANGEW INFORMAT ZAIK 1 50% 0.1% 1
10 IST ANAL SISTEMI INFORMAT ANTONIO RUBERTI 1 10% 0.6% 5

Related classes at same level (level 1)


Rank Relatedness score Related classes
1 0.0000209867 VERTEX COVER//DIFFERENTIAL RATIO//PRIORITY ALGORITHMS
2 0.0000197481 STEINER RATIO//INVERSE FERMAT TORRICELLI PROBLEM//STEINER MINIMAL TREE
3 0.0000187051 MULTICAST ROUTING//QOS ROUTING//GROUP MULTICAST ROUTING
4 0.0000183722 MINIMUM CUTS//MA ORDERING//GRAPH AUGMENTATION
5 0.0000162123 DEGREE CONSTRAINED MINIMUM SPANNING TREE//HOP CONSTRAINTS//BOUNDED DIAMETER MINIMUM SPANNING TREE PROBLEM
6 0.0000156451 K MEDIAN//BROADCAST DOMINATION//FACILITY LOCATION PROBLEM
7 0.0000129544 MINIMUM WEIGHT TRIANGULATION//SPANNERS//SPANNING RATIO
8 0.0000119652 DOMINATION ANALYSIS//MONGE ARRAYS//MONGE PROPERTY
9 0.0000115598 ARC ROUTING//CAPACITATED ARC ROUTING PROBLEM//ARC ROUTING PROBLEMS
10 0.0000083399 INVERSE OPTIMIZATION//OPTIMIZAT DISCRETE MATH//BALANCED OPTIMIZATION