Pages that link to "Item:Q1040584"
From MaRDI portal
The following pages link to A 3.4713-approximation algorithm for the capacitated multicast tree routing problem (Q1040584):
Displaying 10 items.
- OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks (Q281809) (← links)
- \((\alpha,\tau )\)-monitoring for event detection in wireless sensor networks (Q346476) (← links)
- Approximate event detection over multi-modal sensing data (Q346477) (← links)
- Efficient accuracy evaluation for multi-modal sensed data (Q346487) (← links)
- Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem (Q621842) (← links)
- On multi-path routing for reliable communications in failure interdependent complex networks (Q2025105) (← links)
- Balanced tree partition problems with virtual nodes (Q2424724) (← links)
- DOAMI: a distributed on-line algorithm to minimize interference for routing in wireless sensor networks (Q2424872) (← links)
- Approximate Aggregation for Tracking Quantiles in Wireless Sensor Networks (Q2942390) (← links)
- Metric and Distributed On-Line Algorithm for Minimizing Routing Interference in Wireless Sensor Networks (Q3467852) (← links)
