Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
Frequency assignment problems
Panos M Pardalos1999
HANDBOOK OF COMBINATORIAL OPTIMIZATION D.-Z. Du and PM Pardalos (Eds.) pp. 295-377 (c) 1999 Kluwer Academic Publishers Frequency Assignment Problems Robert A. Murphey Wright Laboratory Eglin AFB, FL 32542 USA E-mail: murpheyQeglin. af. mil Panos M. Pardalos Center for Applied Optimization, ISE Department University of Florida, Gainesville, FL 32611 USA E-mail: pardalosOufl. edu Mauricio GC Resende Information Sciences Research Center AT&T Labs Research, Florham Park, NJ 07932 USA E-mail: mgcr9research. att.
Related papers
Frequency planning and ramifications of coloring
Discussiones Mathematicae Graph Theory, 2002
Minimum Span of No-Hole ( r +1)-Distant Colorings
SIAM Journal on Discrete Mathematics, 2001
T-Colorings and T-Edge Spans of Graphs
Graphs and Combinatorics, 1999
Graph domination, coloring and cliques in telecommunications
2006
This chapter aims to provide a detailed survey of existing graph models and algorithms for important problems that arise in different areas of wireless telecommunication. In particular, applications of graph optimization problems such as minimum dominating set, minimum vertex coloring and maximum clique in multihop wireless networks are discussed. Different forms of graph domination have been used extensively to model clustering in wireless ad hoc networks.
No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
Discrete Mathematics, 2007
Asymptotic Clique Covering Ratios of Distance Graphs
European Journal of Combinatorics, 2002
Labelling Graphs with a Condition at Distance 2
SIAM Journal on Discrete Mathematics, 1992
The reader collision problem
IEEE International Conference on Systems, Man and Cybernetics, 2002
This document is currently being converted. Please check back in a few minutes.
Related papers
Interference-Minimizing Colorings of Regular Graphs
SIAM Journal on Discrete Mathematics, 1998
Models and Solution Techniques for Frequency Assignment Problems: updated
Annals of Operations Research, 2007
Frequency assignment in cellular phone networks
Annals of Operations …, 1998
A Branch-And-Price Approach for Graph Multi-Coloring
Operations Research/Computer Science Interfaces Series, 2007
Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
Optimization Letters, 2010
Approximating the L (h, k)-labelling problem
International Journal of Mobile Network Design and …, 2006
Heuristic Algorithms for the Set-Coloring Problem
2006 2nd International Conference on Information & Communication Technologies, 2000
Acyclic colorings of graph subdivisions revisited
Journal of Discrete Algorithms, 2012
Hamiltonian orthogeodesic alternating paths
Journal of Discrete Algorithms, 2012
Strong Colorings of Hypergraphs
Lecture Notes in Computer Science, 2005
A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
Discrete Optimization, 2011
On the chromatic number of graphs
Journal of Optimization Theory and Applications, 2001
On the L(h,k)-Labeling of Co-comparability Graphs
Lecture Notes in Computer Science, 2007
Optimization problems and models for planning cellular networks
Handbook of optimization in telecommunications, 2006
Coloring powers of planar graphs
… of the eleventh annual ACM-SIAM …, 2000
A complexity dichotomy for critical values of the b-chromatic number of graphs
Theoretical Computer Science
Radio k-Labelings for Cartesian Products of Graphs
Discussiones Mathematicae Graph Theory, 2008
- Find new research papers in:
- Physics
- Chemistry
- Biology
- Health Sciences
- Ecology
- Earth Sciences
- Cognitive Science
- Mathematics
- Computer Science