Class information for:
Level 1: K MEDIAN//BROADCAST DOMINATION//FACILITY LOCATION PROBLEM

Basic class information

ID Publications Average number
of references
Avg. shr. active
ref. in WoS
22941 307 20.8 44%



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 K MEDIAN Author keyword 13 61% 5% 14
2 BROADCAST DOMINATION Author keyword 9 83% 2% 5
3 FACILITY LOCATION PROBLEM Author keyword 5 23% 6% 19
4 CROSS MONOTONIC Author keyword 4 67% 1% 4
5 STOCHASTIC FACILITY LOCATION Author keyword 4 67% 1% 4
6 DISCRETE LOCATION THEORY Author keyword 4 75% 1% 3
7 APPROXIMATE COST RECOVERY Author keyword 3 57% 1% 4
8 IOMS OPERAT MANAGEMENT Address 3 57% 1% 4
9 K MEDIAN CLUSTERING Author keyword 3 57% 1% 4
10 FACILITY LOCATION GAME Author keyword 3 100% 1% 3

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 K MEDIAN 13 61% 5% 14 Search K+MEDIAN Search K+MEDIAN
2 BROADCAST DOMINATION 9 83% 2% 5 Search BROADCAST+DOMINATION Search BROADCAST+DOMINATION
3 FACILITY LOCATION PROBLEM 5 23% 6% 19 Search FACILITY+LOCATION+PROBLEM Search FACILITY+LOCATION+PROBLEM
4 CROSS MONOTONIC 4 67% 1% 4 Search CROSS+MONOTONIC Search CROSS+MONOTONIC
5 STOCHASTIC FACILITY LOCATION 4 67% 1% 4 Search STOCHASTIC+FACILITY+LOCATION Search STOCHASTIC+FACILITY+LOCATION
6 DISCRETE LOCATION THEORY 4 75% 1% 3 Search DISCRETE+LOCATION+THEORY Search DISCRETE+LOCATION+THEORY
7 APPROXIMATE COST RECOVERY 3 57% 1% 4 Search APPROXIMATE+COST+RECOVERY Search APPROXIMATE+COST+RECOVERY
8 K MEDIAN CLUSTERING 3 57% 1% 4 Search K+MEDIAN+CLUSTERING Search K+MEDIAN+CLUSTERING
9 FACILITY LOCATION GAME 3 100% 1% 3 Search FACILITY+LOCATION+GAME Search FACILITY+LOCATION+GAME
10 K CENTER 3 29% 3% 9 Search K+CENTER Search K+CENTER

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 P CENTER PROBLEM 6 31% 6% 17
2 MEDIAN PROBLEMS 3 35% 3% 8
3 K CENTER PROBLEM 2 44% 1% 4
4 FACILITY LOCATION PROBLEMS 2 21% 3% 9
5 FACTOR APPROXIMATION ALGORITHM 1 100% 1% 2
6 MAXIMIZATION VERSION 1 40% 1% 2
7 CORESETS 1 33% 1% 2
8 FIXED CHARGE TRANSPORTATION 1 50% 0% 1
9 DISTRIBUTED DATA MANAGEMENT 1 29% 1% 2
10 TIME APPROXIMATION ALGORITHMS 0 33% 0% 1

Journals

Reviews

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 IOMS OPERAT MANAGEMENT 3 57% 1.3% 4
2 BIOINFORMAT GRP BIORG 1 50% 0.3% 1
3 GANDHI ENGN 1 50% 0.3% 1
4 JAVA COMPILERS TOOLS 1 50% 0.3% 1
5 SPECIAL INTE T GRP 1 50% 0.3% 1
6 SYST LSI GRP 1 50% 0.3% 1
7 ADV ARCHITECTU AUTOMAT BRANCH 0 33% 0.3% 1
8 BASIC COURSES TEACHING 0 33% 0.3% 1
9 MODERN ARTS SCI COMMERCE 0 25% 0.3% 1
10 NSF INTELLIGENT MAINTENANCE SYST 0 25% 0.3% 1

Related classes at same level (level 1)



Rank Relatedness score Related classes
1 0.0000223171 VERTEX COVER//DIFFERENTIAL RATIO//PRIORITY ALGORITHMS
2 0.0000206788 SUPPLY CHAIN NETWORK DESIGN//SUPPLY CHAIN DESIGN//FACILITY LOCATION
3 0.0000156451 APPROXIMATION ALGORITHMS//RANGE ASSIGNMENT//MINIMUM ENERGY BROADCAST
4 0.0000126810 CONTINUOUS LOCATION//COMPETITIVE LOCATION//FACILITY LOCATION
5 0.0000091257 PROPERTY TESTING//PROBABILISTICALLY CHECKABLE PROOFS//SUBLINEAR ALGORITHMS
6 0.0000079295 PRICE OF ANARCHY//SELFISH ROUTING//CONGESTION GAMES
7 0.0000075460 DOMINATION ANALYSIS//MONGE ARRAYS//MONGE PROPERTY
8 0.0000069592 GUILLOTINE PARTITIONS//SORTABILITY//MOSAIC FLOORPLAN
9 0.0000065208 DEGREE CONSTRAINED MINIMUM SPANNING TREE//HOP CONSTRAINTS//BOUNDED DIAMETER MINIMUM SPANNING TREE PROBLEM
10 0.0000060382 ON LINE ALGORITHMS//COMPETITIVE ANALYSIS//K SERVER PROBLEM