Mugurel Ionut Andreica () (Parallel and Distributed Systems Laboratory - Polytechnic University of Bucharest, Parallel and Distributed Systems Laboratory - Polytechnic University of Bucharest - Faculty of Automatic Control and Computer Science) Angela Andreica () (Management and Finances Center - Commercial Academy Satu Mare) Romulus Andreica () (Management and Finances Center - Commercial Academy Satu Mare)
Abstract
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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by HAL in its series Post-Print with number
hal-00323317_v1.
Length: 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 Handle: RePEc:hal:journl:hal-00323317_v1
Note: View the original document on HAL open archive server: http://hal.archives-ouvertes.fr/hal-00323317/en/ Contact details of provider: Web page: http://hal.archives-ouvertes.fr/
For technical questions regarding this item, or to correct its listing, contact: (CCSD).