Pages that link to "Item:Q5958140"
From MaRDI portal
The following pages link to Approximation algorithms for channel assignment with constraints (Q5958140):
Displaying 10 items.
- Channel-based coordination via constraint satisfaction (Q541681) (← links)
- The channel assignment problem for mutually adjacent sites (Q1336445) (← links)
- A doubly cyclic channel assignment problem (Q1382286) (← links)
- Optimal channel assignment and \(L(p,1)\)-labeling (Q1630278) (← links)
- On the precise value of the strong chromatic index of a planar graph with a large girth (Q1671365) (← links)
- Combinatorial approximation algorithms for spectrum assignment problem in chain and ring networks (Q1699773) (← links)
- On the span in channel assignment problems: Bounds, computing and counting (Q1810659) (← links)
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems (Q2817849) (← links)
- A Theorem about the Channel Assignment Problem (Q4443099) (← links)
- Approximation Algorithms for Minimum Span Channel Assignment Problems (Q5434411) (← links)