A tight analysis of the greedy algorithm for set cover
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A reusable architecture for simulations
Communications of the ACM
Observations on the complexity of composable simulation
Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future - Volume 1
Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics
Introduction to Algorithms
The computational complexity of component selection in simulation reuse
WSC '05 Proceedings of the 37th conference on Winter simulation
Component Adaptation Architectures A Formal Approach
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III
A Hybrid Evolutionary Multiobjective Approach for the Component Selection Problem
HAIS '08 Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems
Automatic configuration for the component selection problem
CSTST '08 Proceedings of the 5th international conference on Soft computing as transdisciplinary science and technology
Semi-automated simulation transformation for DDDAS
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
| Hi-index | 0.00 |
Simulation composability is a difficult capability to achieve due to the challenges of creating components, selecting combinations of components, and integrating the selected components. We address the second of these challenges through analysis of Component Selection (CS), the NP-complete process of selecting a minimal set of components to satisfy a set of objectives. Due to the high order of computational complexity of CS, we examine approximating solutions that make the CS process practicable. We define two variations of CS and prove that good approximations to optimal solutions result from applying a standard Greedy selection algorithm to each. Despite our creation of approximable variations of CS, we conjecture that any proof of the inapproximability of CS will reveal theoretical limitations of its practicality. We conclude that reasonably constrained variations of CS can be solved satisfactorily, and efficiently, but more general cases appear to never be solvable in a similar manner.