Web of Lossy Adapters for Interface Interoperability: An Algorithm and NP-completeness of Minimization
Software Engineering
2010-12-01 v1 Data Structures and Algorithms
Abstract
By using different interface adapters for different methods, it is possible to construct a maximally covering web of interface adapters which incurs minimum loss during interface adaptation. We introduce a polynomial-time algorithm that can achieve this. However, we also show that minimizing the number of adapters included in a maximally covering web of interface adapters is an NP-complete problem.
Cite
@article{arxiv.0907.3583,
title = {Web of Lossy Adapters for Interface Interoperability: An Algorithm and NP-completeness of Minimization},
author = {Yoo Chung and Dongman Lee},
journal= {arXiv preprint arXiv:0907.3583},
year = {2010}
}
Comments
7 pages