Pages that link to "Item:Q952444"
From MaRDI portal
The following pages link to On the complexity of bandwidth allocation in radio networks (Q952444):
Displaying 14 items.
- Bandwidth allocation in cellular networks with multiple interferences (Q494422) (← links)
- The backbone coloring problem for bipartite backbones (Q497343) (← links)
- On the complexity of the flow coloring problem (Q499367) (← links)
- Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence (Q501652) (← links)
- Optimal gathering in radio grids with interference (Q714836) (← links)
- Optimal gathering protocols on paths under interference constraints (Q1045041) (← links)
- Using the minimum maximum flow degree to approximate the flow coloring problem (Q2675725) (← links)
- Cross line and column generation for the cut covering problem in wireless networks (Q2883571) (← links)
- THE PROPORTIONAL COLORING PROBLEM: OPTIMIZING BUFFERS IN RADIO MESH NETWORKS (Q3166742) (← links)
- Round weighting problem and gathering in radio networks with symmetrical interference (Q3178168) (← links)
- GATHERING RADIO MESSAGES IN THE PATH (Q4928335) (← links)
- Distributed link scheduling in wireless networks (Q5858167) (← links)
- A strongly polynomial algorithm for the minimum maximum flow degree problem (Q6161285) (← links)
- Gossiping with interference in radio ring networks (Q6599790) (← links)
