Next:
Spanning Trees
Up:
A compendium of NP
Previous:
MINIMUM GRAPH INFERENCE
Index
Network Design
Network Design
Spanning Trees
M
INIMUM
K
-S
PANNING
T
REE
M
INIMUM
D
EGREE
S
PANNING
T
REE
M
INIMUM
G
EOMETRIC 3-
D
EGREE
S
PANNING
T
REE
M
AXIMUM
L
EAF
S
PANNING
T
REE
M
AXIMUM
M
INIMUM
M
ETRIC
K
-S
PANNING
T
REE
M
INIMUM
D
IAMETER
S
PANNING
S
UBGRAPH
M
INIMUM
C
OMMUNICATION
C
OST
S
PANNING
T
REE
M
INIMUM
S
TEINER
T
REE
M
INIMUM
G
EOMETRIC
S
TEINER
T
REE
M
INIMUM
G
ENERALIZED
S
TEINER
N
ETWORK
M
INIMUM
R
OUTING
T
REE
C
ONGESTION
M
AXIMUM
M
INIMUM
S
PANNING
T
REE
D
ELETING
K
E
DGES
M
INIMUM
U
PGRADING
S
PANNING
T
REE
Cuts and Connectivity
M
AXIMUM
C
UT
M
INIMUM
C
ROSSING
N
UMBER
M
AXIMUM
D
IRECTED
C
UT
M
AXIMUM
K
-C
UT
M
INIMUM
N
ETWORK
I
NHIBITION ON
P
LANAR
G
RAPHS
M
INIMUM
K
-C
UT
M
INIMUM
V
ERTEX
K
-C
UT
M
INIMUM
M
ULTIWAY
C
UT
M
INIMUM
M
ULTI-
C
UT
M
INIMUM
R
ATIO-
C
UT
M
INIMUM
B
-B
ALANCED
C
UT
M
INIMUM
B
-V
ERTEX
S
EPARATOR
M
INIMUM
Q
UOTIENT
C
UT
M
INIMUM
K
-V
ERTEX
C
ONNECTED
S
UBGRAPH
M
INIMUM
K
-E
DGE
C
ONNECTED
S
UBGRAPH
M
INIMUM
B
ICONNECTIVITY
A
UGMENTATION
M
INIMUM
S
TRONG
C
ONNECTIVITY
A
UGMENTATION
M
INIMUM
B
OUNDED
D
IAMETER
A
UGMENTATION
Routing Problems
M
INIMUM
T
RAVELING
S
ALESPERSON
M
INIMUM
M
ETRIC
T
RAVELING
S
ALESPERSON
P
ROBLEM
M
INIMUM
G
EOMETRIC
T
RAVELING
S
ALESPERSON
M
INIMUM
M
ETRIC
T
RAVELING
K
-S
ALESPERSON
P
ROBLEM
M
INIMUM
M
ETRIC
B
OTTLENECK
W
ANDERING
S
ALESPERSON
P
ROBLEM
M
INIMUM
C
HINESE
P
OSTMAN FOR
M
IXED
G
RAPHS
M
INIMUM
K
-C
HINESE
P
OSTMAN
P
ROBLEM
M
INIMUM
S
TACKER
C
RANE
P
ROBLEM
M
INIMUM
K
-S
TACKER
C
RANE
P
ROBLEM
M
INIMUM
G
ENERAL
R
OUTING
L
ONGEST
P
ATH
S
HORTEST
W
EIGHT-
C
ONSTRAINED
P
ATH
M
INIMUM
R
ECTILINEAR
G
LOBAL
R
OUTING
M
INIMUM
T
RAVELING
R
EPAIRMAN
M
AXIMUM
Q
UADRATIC
A
SSIGNMENT
Flow Problems
M
AXIMUM
P
RIORITY
F
LOW
M
AXIMUM
I
NTEGRAL
K
-M
ULTICOMMODITY
F
LOW ON
T
REES
M
AXIMUM
D
ISJOINT
C
ONNECTING
P
ATHS
M
INIMUM
M
AXIMUM
D
ISJOINT
C
ONNECTING
P
ATHS
M
INIMUM
S
INGLE-
S
INK
E
DGE
I
NSTALLATION
M
INIMUM
U
NSPLITTABLE
F
LOW
Miscellaneous
M
INIMUM
B
ROADCAST
T
IME
M
INIMUM
K
-C
ENTER
M
INIMUM
K
-C
LUSTERING
M
INIMUM
K
-C
LUSTERING
S
UM
M
INIMUM
K
-S
UPPLIER
M
INIMUM
K
-M
EDIAN
M
INIMUM
D
IAMETERS
D
ECOMPOSITION
M
AXIMUM
K
-F
ACILITY
D
ISPERSION
M
INIMUM
F
ACILITY
L
OCATION
M
AXIMUM
K
-F
ACILITY
L
OCATION
M
INIMUM
K
-S
WITCHING
N
ETWORK
M
INIMUM
B
END
N
UMBER
M
INIMUM
L
ENGTH
T
RIANGULATION
M
INIMUM
S
EPARATING
S
UBDIVISION
Viggo Kann
2000-03-20
