Inferring Company Structure from Limited Available Information
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.
|Date of creation:||10 Sep 2008|
|Date of revision:|
|Publication status:||Published - Presented, International Symposium on Social Development and Economic Performance, 2008, Satu Mare, Romania|
|Note:||View the original document on HAL open archive server: http://hal.archives-ouvertes.fr/hal-00323317|
|Contact details of provider:|| Web page: http://hal.archives-ouvertes.fr/|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- S. Illeris & G. Akehurst, 2002. "Introduction," The Service Industries Journal, Taylor & Francis Journals, vol. 22(1), pages 1-3, January.
When requesting a correction, please mention this item's handle: RePEc:hal:journl:hal-00323317. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (CCSD)
If references are entirely missing, you can add them using this form.