In this paper we present several algorithmic techniques for inferring the structure of a company when only a limited amount of information is available. We consider problems with two types of inputs: the number of pairs of employees with a given property and restricted information about the hierarchical structure of the company. We provide dynamic programming and greedy algorithms for these problems.
Proceedings of the International Symposium on Social Development and Economic Performance - Supplement of the magazine "Quality - Access to Success", vol. 89, pp. 412-416, Satu Mare, 20-21 June, 2008. (ISSN: 1582-2559)