Pages that link to "Item:Q5449519"
From MaRDI portal
The following pages link to Latency Constrained Aggregation in Sensor Networks (Q5449519):
Displaying 19 items.
- The submodular joint replenishment problem (Q304238) (← links)
- Message batching in wireless sensor networks -- a perturbation analysis approach (Q609559) (← links)
- Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← links)
- Data relaying with constraints in hierarchical sensor networks (Q857769) (← links)
- QoS and data relaying for wireless sensor networks (Q883273) (← links)
- Capacitated max-batching with interval graph compatibilities (Q899311) (← links)
- Data aggregation in sensor networks: Balancing communication and delay costs (Q1008733) (← links)
- Layer-based data aggregation and performance analysis in wireless sensor networks (Q1789963) (← links)
- The complexity of data aggregation in static and dynamic wireless sensor networks (Q2013589) (← links)
- A weakly robust PTAS for minimum clique partition in unit disk graphs (Q2428685) (← links)
- Continuous data aggregation and capacity in probabilistic wireless sensor networks (Q2443003) (← links)
- Contour maps: monitoring and diagnosis in sensor networks (Q2506799) (← links)
- Scale-free aggregation in sensor networks (Q2575090) (← links)
- Latency-constrained aggregation in sensor networks (Q2930288) (← links)
- Clique partitioning of interval graphs with submodular costs on the cliques (Q3004202) (← links)
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs (Q3012804) (← links)
- Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint (Q3512451) (← links)
- Latency Constrained Aggregation in Chain Networks Admits a PTAS (Q3638456) (← links)
- Algorithmic Aspects of Wireless Sensor Networks (Q5312968) (← links)
