An Optimal Placement of a Liaison with Short Communication Lengths Between Two Members of the Same Level in an Organization Structure of a Complete K-ary Tree

Kiyoshi Sawada ()
Additional contact information
Kiyoshi Sawada: University of Marketing and Distribution Sciences

A chapter in Operations Research Proceedings 2013, 2014, pp 389-395 from Springer

Abstract: Abstract This paper proposes a model of placing a liaison which forms relations to two members in the same level of a pyramid organization structure when lengths between the liaison and the other members are less than those between members except the liaison in the organization such that the communication of information between every member in the organization becomes the most efficient. For a model of adding a node of liaison which gets adjacent to two nodes with the same depth in a complete $$K$$ K -ary tree of height $$H$$ H where the lengths of edges between the liaison and the other members are $$L(0

Keywords: Short Path; Shorten Distance; Organization Structure; Common Ancestor; Operation Research (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-07001-8_53

Ordering information: This item can be ordered from
http://www.springer.com/9783319070018

DOI: 10.1007/978-3-319-07001-8_53

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().