APPLICATION OF THE GRAPH COLORING ALGORITHM TO THE FREQUENCY ASSIGNMENT PROBLEM

DOI10.15807/JORSJ.39.258MaRDI QIDQ5284947zbMATHOpenAlexFDO

Authors Tae Hoon Park, Chae Y. Lee

Publication date 10 June 1997

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/94c452a20890d201443bc2cbfac513c38533cc2a

zbMATH Keywords

heuristicsfrequency assignment\(k\)-coloring problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 1795728
• Bounds for the frequency assignment problem
• scientific article; zbMATH DE number 4065018

Cited in

(17)

• scientific article; zbMATH DE number 1819633 (Why is no real title available?)
• scientific article; zbMATH DE number 1795728 (Why is no real title available?)
• A column generation and branch-and-cut algorithm for the channel assignment problem
• A T-coloring algorithm based on multiagent evolution
• Using Laplacian eigenvalues and eigenvectors in the analysis of frequency assignment problems
• scientific article; zbMATH DE number 4065018 (Why is no real title available?)
• Simple decentralized graph coloring
• A Technique for Estimating the Minimum Number of Frequencies Required for Urban Mobile Radio Communication
• Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge
• Semi-definite positive programming relaxations for graph \(K_n\)-coloring in frequency assignment.
• Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring
• Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks
• scientific article; zbMATH DE number 1163304 (Why is no real title available?)
• scientific article; zbMATH DE number 1417706 (Why is no real title available?)
• Models and solution techniques for frequency assignment problems
• Constraint and satisfiability reasoning for graph coloring
• Distance-constrained grid colouring

This page was built for publication: APPLICATION OF THE GRAPH COLORING ALGORITHM TO THE FREQUENCY ASSIGNMENT PROBLEM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5284947)