Cited By
View all- Tang DWoo LBahl L(1978)Optimization of Teleprocessing Networks with Concentrators and Multiconnected TerminalsIEEE Transactions on Computers10.1109/TC.1978.167515927:7(594-604)Online publication date: 1-Jul-1978
Optimum concentrator location in telecommunications design
Pages 534 - 542
Abstract
This paper discusses the problem of the allocation of concentrators in the initial phases of telecommunications design. A model for this problem is presented in which the trade-off between line cost and the number of concentrators can be examined. An approach to obtaining a solution for this formulation involves minimum k-cover configurations, for which an efficient algorithm is presented.
References
[1]
Balinski, M. L. and Quandt, R. E., "On an integer program for a delivery problem", Op. Res., 12, 300-304, 1963
[2]
Balinski, M. L., "Integer programming: methods, uses, computations", Mgt. Sci., 12, #13, 253-313, 1965
[3]
Bellman, R., "An application of dynamic programming to location-allocation problems", SIAM Review, 7, #1, 126-128, 1965
[4]
Edmonds, J., "Paths, trees, and flowers", Can. J. Math., 17, 449-467, 1965
[5]
Edmonds, "Maximum matching and polyhedron with 0,1-vertices", J. Res. NBS, 69B, #1/2, 125-130, 1965
[6]
Esau, L. R. and Williams, K. C., On teleprocessing design, part II: "A method for approximating the optimal network", IBM Sys. Journal, 5, #3, 142-147, 1966.
[7]
Everett III, H., "Generalized Lagrange multiplier method for solving problems of optimum allocation of resources", Op. Res., 11, 399-417, 1963
[8]
Gavett, J. W. and Plyter, N. V., "The optimal assignment of facilities to locations by branch and bound", Op. Res., 14, #2, 210-232, 1966
[9]
Kaplan, S., "Tha advancing communication technology and computer communication systems", Proc. of 1968 SJCC, 119-133
[10]
Lawler, E. L., "The quadratic assignment problem", Mgt. Sci., 9, #4, 586-599, 1963
[11]
Palermo, F. P., "A network minimization problem", IBM J. Res. Devel., 5, 335-337, 1961
[12]
Norman, R. Z. and Rabin, M. O., "An algorithm for a minimum cover of a graph", Proc. Am. Math. Soc., 10, 315-319
[13]
White, L. J., "Minimum covers of fixed cardinality in weighted graphs", SIAM J. of Applied Math., 21, #1, 104-113, 1971
[14]
White, L. J. and Gillenson, M. L., "An efficient algorithm for minimum k-covers in weighted graphs", submitted to Mathematical Programming, SIGMAP of ACM, 1971
[15]
White, L. J. and Gillenson, M. L., "Optimum data allocation", Technical Report OSU-CISRC-TR-72-1, Computer and Information Science Research Center, The Ohio State University, January, 1972
- Optimum concentrator location in telecommunications design
Recommendations
The Erdős-Hajnal conjecture for rainbow triangles
We prove that every 3-coloring of the edges of the complete graph on n vertices without a rainbow triangle contains a set of order ( n 1 / 3 log 2 n ) which uses at most two colors, and this bound is tight up to a constant factor. This verifies a ...
A greedy location management scheme using predictive dynamic reservation into dynamic set method
AINTEC '08: Proceedings of the 4th Asian Conference on Internet EngineeringIntegration of WLAN hotspots into next generation cellular networks requires considerations on location management, resource allocation, handoff algorithms and their sensitivity to mobility related features such as velocity of the mobile and the handoff ...
A solution for the location problem in arbitrary computer networks using generic dominating sets
SAC '05: Proceedings of the 2005 ACM symposium on Applied computingMany problems exist related to the location problems of resources in a computer network to accommodate client demands subject to constraints imposed on the clients and the servers. For example, one classical location problem consists of computing the ...
Comments
Information & Contributors
Information
Published In
Copyright © 1972 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 August 1972
Check for updates
Author Tags
Qualifiers
- Article
Conference
ACM '72
Sponsor:
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 249Total Downloads
- Downloads (Last 12 months)39
- Downloads (Last 6 weeks)3
Reflects downloads up to 12 Aug 2024
Other Metrics
Citations
Cited By
View all- Tang DWoo LBahl L(1978)Optimization of Teleprocessing Networks with Concentrators and Multiconnected TerminalsIEEE Transactions on Computers10.1109/TC.1978.167515927:7(594-604)Online publication date: 1-Jul-1978
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in