Pages that link to "Item:Q3189016"
From MaRDI portal
The following pages link to Minimizing flow time in the wireless gathering problem (Q3189016):
Displaying 6 items.
- The distributed wireless gathering problem (Q627160) (← links)
- An approximation algorithm for the wireless gathering problem (Q957364) (← links)
- Maximum induced matching algorithms via vertex ordering characterizations (Q1986960) (← links)
- Maximum Induced Matchings in Grids (Q4596162) (← links)
- Maximum Induced Matching Algorithms via Vertex Ordering Characterizations (Q5136263) (← links)
- Induced matchings in strongly biconvex graphs and some algebraic applications (Q6081912) (← links)