Pages that link to "Item:Q271922"
From MaRDI portal
The following pages link to Geometric partitioning and robust ad-hoc network design (Q271922):
Displaying 6 items.
- Minimum-cost load-balancing partitions (Q834581) (← links)
- Continuous graph partitioning for camera network surveillance (Q2342775) (← links)
- Fast distributed algorithm for convergecast in ad hoc geometric radio networks (Q2497727) (← links)
- Robust partitioning for stochastic multivehicle routing (Q2846428) (← links)
- Optimal link constructions of network topology design using partitioning method in Ad Hoc environments (Q5455037) (← links)
- A faster algorithm for the constrained minimum covering circle problem to expedite solving <i>p</i>‐center problems in an irregularly shaped area with holes (Q6053130) (← links)