Lower bounds for three algorithms for transversal hypergraph generation
Discrete Applied Mathematics
| Hi-index | 0.00 |
Web Services are beginning to play a major role in future Web architectures and software applications. One of the most important research directions in the area of Web services is the development of techniques for automatically discovering collections of services that satisfy a set of interestingness constraints. Discovery of interesting collections of Web services is a challenging problem, however, due to the high complexity involved. In this paper, we present a new method for discovery of interesting collections of Web services, according to user specified cost constraints. We show that this task is closely related to the well-known problem of computing the transversals of a hypergraph. We experimentally evaluate our approach and show that pruning and partitioning techniques can significantly improve running time.