Frequency planning and ramifications of coloring
From MaRDI portal
Publication:4786789
DOI10.7151/dmgt.1158zbMath1055.05147OpenAlexW2004488416MaRDI QIDQ4786789
Andreas Eisenblätter, Arie M. C. A. Koster, Martin Grötschel
Publication date: 2002
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1158
Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Coloring of graphs and hypergraphs (05C15)
Related Items
An Exact Site Availability Approach to Modeling the D-FAP, Three tabu search methods for the MI-FAP applied to 802.11 networks, On some applications of the selective graph coloring problem, Inverse chromatic number problems in interval and permutation graphs, Algorithms for the generalized weighted frequency assignment problem, Inverse interval scheduling via reduction on a single machine, BCH codes and distance multi- or fractional colorings in hypercubes asymptotically, Regular pattern-free coloring, On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming, SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints, On the structure of (even hole, kite)-free graphs, Models and solution techniques for frequency assignment problems, An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming, SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0), Greedy \(T\)-colorings of graphs, Graphs and Algorithms in Communication Networks on Seven League Boots, Mathematical Optimization Models for WLAN Planning, A novel approach for solving semidefinite programs, A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
Uses Software
