Issue No. 09 - September (1988 vol. 37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.2270
The problem of minimizing the number of service ports of a central facility which serves a number of users subject to some constraints is addressed. At any time, a set of at most s users may want to use the facility, and one user can be connected to each port at a given time. It is assumed that there are direct communication links from users to service ports, with at most d links incident at a
communication networks; bounded fan-in; service ports; users; graph-theoretic problem; bipartite graph; linear programming; computer networks; graph theory; linear programming.
D. West and P. Banerjee, "On the Construction of Communication Networks Satisfying Bounded Fan-In of Service Ports," in IEEE Transactions on Computers, vol. 37, no. , pp. 1148-1151, 1988.