Class information for:
Level 1: MULTICAST ROUTING//QOS ROUTING//GROUP MULTICAST ROUTING

Basic class information

ID Publications Average number
of references
Avg. shr. active
ref. in WoS
6933 1350 21.6 33%



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 MULTICAST ROUTING Author keyword 23 21% 7% 97
2 QOS ROUTING Author keyword 20 21% 6% 84
3 GROUP MULTICAST ROUTING Author keyword 8 100% 0% 5
4 STEINER TREE Author keyword 7 15% 3% 45
5 CONSTRAINED STEINER TREE Author keyword 7 57% 1% 8
6 CRITICAL EXTREME POINT Author keyword 6 80% 0% 4
7 STEINER NETWORKS Author keyword 6 80% 0% 4
8 STEINER TREE PROBLEM Author keyword 6 32% 1% 16
9 MULTI CONSTRAINED PATH Author keyword 6 58% 1% 7
10 STEINER PROBLEM Author keyword 6 36% 1% 13

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 MULTICAST ROUTING 23 21% 7% 97 Search MULTICAST+ROUTING Search MULTICAST+ROUTING
2 QOS ROUTING 20 21% 6% 84 Search QOS+ROUTING Search QOS+ROUTING
3 GROUP MULTICAST ROUTING 8 100% 0% 5 Search GROUP+MULTICAST+ROUTING Search GROUP+MULTICAST+ROUTING
4 STEINER TREE 7 15% 3% 45 Search STEINER+TREE Search STEINER+TREE
5 CONSTRAINED STEINER TREE 7 57% 1% 8 Search CONSTRAINED+STEINER+TREE Search CONSTRAINED+STEINER+TREE
6 CRITICAL EXTREME POINT 6 80% 0% 4 Search CRITICAL+EXTREME+POINT Search CRITICAL+EXTREME+POINT
7 STEINER NETWORKS 6 80% 0% 4 Search STEINER+NETWORKS Search STEINER+NETWORKS
8 STEINER TREE PROBLEM 6 32% 1% 16 Search STEINER+TREE+PROBLEM Search STEINER+TREE+PROBLEM
9 MULTI CONSTRAINED PATH 6 58% 1% 7 Search MULTI+CONSTRAINED+PATH Search MULTI+CONSTRAINED+PATH
10 STEINER PROBLEM 6 36% 1% 13 Search STEINER+PROBLEM Search STEINER+PROBLEM

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 INTEGER POLYHEDRA 29 88% 1% 14
2 SPANNING NETWORKS 17 79% 1% 11
3 STEINER PROBLEM 11 31% 2% 29
4 RESTRICTED SHORTEST PATH 10 54% 1% 13
5 LOW COST MULTICAST 6 100% 0% 4
6 STEINER TREE PROBLEMS 5 54% 1% 7
7 TREE POLYTOPE 5 63% 0% 5
8 CONNECTIVITY CONSTRAINTS 5 38% 1% 10
9 IMPROVED FPTAS 4 67% 0% 4
10 FASTER APPROXIMATION ALGORITHM 4 75% 0% 3

Journals

Reviews



Title Publ. year Cit. Active references % act. ref.
to same field
A survey of combinatorial optimization problems in multicast routing 2005 85 39 77%
Design of survivable networks: A survey 2005 64 69 52%
Providing service differentiation in pure IP-based networks 2012 2 8 63%
Multipoint communication: A survey of protocols, functions, and mechanisms 1997 159 23 48%
STEINER TREE PROBLEMS 1992 185 105 32%
Dynamic routing in the ATM-networks: Problems and solutions 2003 0 4 75%
The multimedia multicasting problem 1998 24 32 22%
Internet multicast routing and transport control protocols 2002 17 21 10%

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 LEHRGEBIET RECHNERNETZE VERTEILTE SYST 3 100% 0.2% 3
2 PRINCESS FATIMAH ALNIJRIS CHAIR AMT 2 36% 0.3% 4
3 NETWORKS TELECOMS 1 50% 0.1% 2
4 OPERAT SUPPORT SYST 1 50% 0.1% 2
5 SYST RD S 1 50% 0.1% 2
6 AUTOMATED EDULING OPTIMISAT PLANNING AS GR 1 25% 0.3% 4
7 COMBINATORIAL OPTIMIZAT GRP 1 27% 0.2% 3
8 COMMUN TELEMAT 1 25% 0.2% 3
9 GLOBAL INFORMAT TELECOMMUN 1 11% 0.5% 7
10 ADV INTERNET TECHNOL GRP 1 50% 0.1% 1

Related classes at same level (level 1)



Rank Relatedness score Related classes
1 0.0000225230 DEGREE CONSTRAINED MINIMUM SPANNING TREE//HOP CONSTRAINTS//BOUNDED DIAMETER MINIMUM SPANNING TREE PROBLEM
2 0.0000215167 STEINER RATIO//INVERSE FERMAT TORRICELLI PROBLEM//STEINER MINIMAL TREE
3 0.0000187051 APPROXIMATION ALGORITHMS//RANGE ASSIGNMENT//MINIMUM ENERGY BROADCAST
4 0.0000162570 RELIABLE MULTICAST//MANY TO MANY SESSION//FEEDBACK SUPPRESSION
5 0.0000121564 BGP//BORDER GATEWAY PROTOCOL BGP//INTERDOMAIN ROUTING
6 0.0000092977 HUB LOCATION//SERVICE NETWORK DESIGN//HUB LOCATION PROBLEMS
7 0.0000092282 MULTIOBJECTIVE SHORTEST PATH PROBLEM//LABELING ALGORITHMS//SHORTEST PATH PROBLEM
8 0.0000082956 PHOTONIC NETWORK COMMUNICATIONS//TRAFFIC GROOMING//OPTICAL NETWORKS
9 0.0000072902 COUNTING TO INFINITY//POPULATION CONSTRAINT//SEMAPHORE QUEUE
10 0.0000066973 ARC ROUTING//CAPACITATED ARC ROUTING PROBLEM//ARC ROUTING PROBLEMS