Directed weighted improper coloring for cellular channel allocation
From MaRDI portal
branch-and-price algorithmchannel assignmentgraph coloringset partitioning formulationsweighted directed graphs
Partitions of sets (05A18) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22) Detection theory in information and communication theory (94A13) Channel models (including quantum) in information and communication theory (94A40)
Recommendations
Cites work
- A Column Generation Approach for Graph Coloring
- A column generation approach for the split delivery vehicle routing problem
- Branch-and-price: Column generation for solving huge integer programs
- Column Generation
- Column generation based primal heuristics
- Defective coloring revisited
- Optimal solutions for routing problems with profits
- The split delivery capacitated team orienteering problem
Cited in
(12)- Distributed long-lived list colouring: How to dynamically allocate frequencies in cellular networks
- Weighted improper colouring
- Vertex coloring edge-weighted digraphs
- A comparison of integer programming models for the partial directed weighted improper coloring problem
- Constructive algorithms for the partial directed weighted improper coloring problem
- Improper coloring of weighted grid and hexagonal graphs
- Parameterized (approximate) defective coloring
- Parameterized (approximate) defective coloring
- Defective Coloring on Classes of Perfect Graphs
- Graph-Theoretic Concepts in Computer Science
- On the structural parameterized complexity of defective coloring
- Bounds and fixed-parameter algorithms for weighted improper coloring
This page was built for publication: Directed weighted improper coloring for cellular channel allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2255043)