Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks
From MaRDI portal
(Redirected from Publication:322774)
Recommendations
Cites work
- scientific article; zbMATH DE number 3943863 (Why is no real title available?)
- scientific article; zbMATH DE number 956851 (Why is no real title available?)
- A GRASP for coloring sparse graphs
- A branch-and-cut algorithm for graph coloring
- A cutting plane algorithm for graph coloring
- A graph coloring algorithm for large scheduling problems
- A probabilistic heuristic for a computationally difficult set covering problem
- A survey on vertex coloring problems
- A topology control approach for utilizing multiple channels in multi-radio wireless mesh networks
- An exact approach for the vertex coloring problem
- Cellular network configuration with co-channel and adjacent-channel interference constraints
- Greedy randomized adaptive search procedures
- Heuristic manipulation, tabu search and frequency assignment
- Hierarchical cellular network design with channel allocation
- Models and solution techniques for frequency assignment problems
- Negative cycle separation in wireless network design
- New methods to color the vertices of a graph
- Reducibility among combinatorial problems
- Some simplified NP-complete graph problems
- The capacity of wireless networks
- The greedy coloring is a bad probabilistic algorithm
Cited in
(4)
This page was built for publication: Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322774)