Publication | Closed Access
A Note on the Complexity of the Star-Star Concentrator Problem
18
Citations
11
References
1981
Year
Mathematical ProgrammingCluster ComputingComputational Complexity TheoryEngineeringNetwork OperationNetwork PlanningNetwork AnalysisComputational ComplexityDiscrete OptimizationCombinatorial OptimizationNetwork OptimizationNp-complete CasesStar-star Concentrator ProblemComputer EngineeringComputer ScienceNetwork ScienceComputer Network DesignNetwork AlgorithmStellar Structure
The star-star concentrator problem (SSCP) arises in computer network design. The complexity of this problem is studied, and polynomially solvable and (strongly) NP-complete cases are presented.
| Year | Citations | |
|---|---|---|
Page 1
Page 1