The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Frequency assignment: Theory and applications
Abstract
In this paper we introduce the minimum-order approach to frequency assignment and present a theory which relates this approach to the traditional one. This new approach is potentially more desirable than the traditional one. We model assignment problems as both frequency-distance constrained and frequency constrained optimization problems. The frequency constrained approach should be avoided if distance separation is employed to mitigate interference. A restricted class of graphs, called disk graphs, plays a central role in frequency-distance constrained problems. We introduce two generalizations of chromatic number and show that many frequency assignment problems are equivalent to generalized graph coloring problems. Using these equivalences and recent results concerning the complexity of graph coloring, we classify many frequency assignment problems according to the "execution time efficiency" of algorithms that may be devised for their solution. We discuss applications to important real world problems and identify areas for further work.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Harary, F. (1969) · doi:10.21236/ad0705364 · Cited by 4,861
Approximation algorithms for combinatorial problems
Johnson, D. S. (1974) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(74)80044-9 · Cited by 2,197
New methods to color the vertices of a graph
Brélaz, D. (1979) · Communications of the ACM · doi:10.1145/359094.359101 · Cited by 1,567
Computer and job-shop scheduling theory
Coffman, E. G., & Bruno, J. L. (1976) · Medical Entomology and Zoology · Cited by 1,107
An upper bound for the chromatic number of a graph and its application to timetabling problems
Welsh, D. J. A. (1967) · The Computer Journal · doi:10.1093/comjnl/10.1.85 · Cited by 762
Gilbert, E. N. (1961) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0109045 · Cited by 656
Some simplified NP-complete problems
Garey, M. R., Johnson, D. S., & Stockmeyer, L. (1974) · Proceedings of the sixth annual ACM symposium on Theory of computing - STOC '74 · doi:10.1145/800119.803884 · Cited by 614
Padberg, M. (1980) · Mathematical programming studies · doi:10.1007/bfb0120883 · Cited by 577
Machine scheduling problems: Classification, complexity and computations
Rand, G. K. (1977) · European Journal of Operational Research · doi:10.1016/0377-2217(77)90029-7 · Cited by 342
The Complexity of Near-Optimal Graph Coloring
Garey, M. R., & Johnson, D. S. (1976) · Journal of the ACM · doi:10.1145/321921.321926 · Cited by 326
Matula, D. W., Marble, G., & Isaacson, J. D. (1972) · Graph Theory and Computing · doi:10.1016/b978-1-4832-3187-7.50015-5 · Cited by 232
An Efficient Test for Circular-Arc Graphs
Tucker, A. C. (1980) · SIAM Journal on Computing · doi:10.1137/0209001 · Cited by 129
Lewis, H. R., & Papadimitriou, C. H. (1978) · Scientific American · doi:10.1038/scientificamerican0178-96 · Cited by 68
Determining the Chromatic Number of a Graph
McDiarmid, C. (1979) · SIAM Journal on Computing · doi:10.1137/0208001 · Cited by 59
Cited by
Clark, B. N., Colbourn, C. J., & Johnson, D. S. (1990) · Discrete Mathematics · doi:10.1016/0012-365x(90)90358-o · Cited by 1,429
Principles of Constraint Programming
Apt, K. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511615320 · Cited by 888
Quantum computing with neutral atoms
Henriet, L., Beguin, L., Signoles, A., Lahaye, T., Browaeys, A., Reymond, G.-O., & Jurczak, C. (2020) · Quantum · doi:10.22331/q-2020-09-21-327 · Cited by 550
Models and solution techniques for frequency assignment problems
Aardal, K. I., van Hoesel, S. P. M., Koster, A. M. C. A., Mannino, C., & Sassano, A. (2007) · Annals of Operations Research · doi:10.1007/s10479-007-0178-0 · Cited by 339
Unit disk graph recognition is NP-hard
Breu, H., & Kirkpatrick, D. G. (1998) · Computational Geometry · doi:10.1016/s0925-7721(97)00014-x · Cited by 312
Metadata
- Authors
- Hale, W. K.
- Venue
- Proceedings of the IEEE
- Published
- 1980
- Volume
- 68
- Issue
- 12
- Pages
- 1497-1514
- ISSN
- 0018-9219 (ISSN-L)
- OpenAlex
- W2056979696
- Cited by
- 1,344
- References
- 17
- FWCI
- 1.79
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.