Models and solution techniques for frequency assignment problems
TL;DR: In this article, the authors developed different modeling ideas for each of the features of the problem, such as the handling of interference among radio signals, the availability of frequencies, and the optimization criterion.
read more
Abstract: Wireless communication is used in many different situations such as mobile telephony, radio and TV broadcasting, satellite communication, wireless LANs, and military operations. In each of these situations a frequency assignment problem arises with application specific characteristics. Researchers have developed different modeling ideas for each of the features of the problem, such as the handling of interference among radio signals, the availability of frequencies, and the optimization criterion.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Robust, Adaptive, Solar-Powered WSN Framework for Aquatic Environmental Monitoring
TL;DR: An environmental monitoring framework based on a wireless sensor network technology characterized by energy harvesting, robustness with respect to a large class of perturbations and real-time adaptation to the network topology is proposed.
285
Spectrum management in coordinated dynamic spectrum access based cellular networks
Milind M. Buddhikot,Kevin Ryan +1 more
- 05 Dec 2005
TL;DR: This paper investigates practically realizable candidate algorithms for spectrum allocation for homogeneous CDMA networks based on important spectrum management concepts of scope, access fairness, "stickiness" and spectrum utilization.
212
Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks
Guy Even,Zvi Lotker,Dana Ron,Shakhar Smorodinsky +3 more
- 16 Nov 2002
TL;DR: This work introduces and studies a new coloring problem called minimum conflict-free coloring (min-CF-coloring), which considers set systems induced by simple geometric regions in the plane, and obtains a constant-ratio approximation algorithm for rectangles and hexagons.
•Book
New Optimization Algorithms in Physics
Alexander K. Hartmann,Heiko Rieger +1 more
- 01 Jul 2004
TL;DR: The Potts Model is used for Solving Hard Max-cut Problems and Finding Low-energy Configurations and for Computing the Potts Free Energy and Submodular Functions, both of which have applications in physics and engineering.
161
Conflict-free colourings of graphs and hypergraphs
János Pach,Gábor Tardos +1 more
TL;DR: An efficient deterministic algorithm is given to find a conflict-free colouring of the vertices of a hypergraph H if each hyperedge E of H contains a vertex of ‘unique’ colour that does not get repeated in E, and the smallest number of colours required is denoted by χCF(H).
References
Combinatorial optimization: algorithms and complexity
TL;DR: This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NPcomplete problems, more.
7.6K
•Book
Integer and Combinatorial Optimization
George L. Nemhauser,Laurence A. Wolsey +1 more
- 01 Jan 1988
TL;DR: This chapter discusses the Scope of Integer and Combinatorial Optimization, as well as applications of Special-Purpose Algorithms and Matching.
Combinatorial optimization:Algorithms and complexity
TL;DR: Eventually, you will unquestionably discover a supplementary experience and achievement by Spending more cash by spending more cash.
5K
Integer and Combinatorial Optimization: Nemhauser/Integer and Combinatorial Optimization
George L. Nemhauser,Laurence A. Wolsey +1 more
- 16 Jun 1988
Abstract: FOUNDATIONS. The Scope of Integer and Combinatorial Optimization. Linear Programming. Graphs and Networks. Polyhedral Theory. Computational Complexity. Polynomial-Time Algorithms for Linear Programming. Integer Lattices. GENERAL INTEGER PROGRAMMING. The Theory of Valid Inequalities. Strong Valid Inequalities and Facets for Structured Integer Programs. Duality and Relaxation. General Algorithms. Special-Purpose Algorithms. Applications of Special- Purpose Algorithms. COMBINATORIAL OPTIMIZATION. Integral Polyhedra. Matching. Matroid and Submodular Function Optimization. References. Indexes.
4.4K
New methods to color the vertices of a graph
TL;DR: An exact method is given which performs better than the Randall-Brown algorithm and is able to color larger graphs and the new heuristic methods, the classical methods, and the exact method are compared.
1.7K