Pages that link to "Item:Q5449519"
From MaRDI portal
The following pages link to Latency Constrained Aggregation in Sensor Networks (Q5449519):
Displaying 8 items.
- The submodular joint replenishment problem (Q304238) (← links)
- Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← links)
- Capacitated max-batching with interval graph compatibilities (Q899311) (← links)
- Data aggregation in sensor networks: Balancing communication and delay costs (Q1008733) (← links)
- A weakly robust PTAS for minimum clique partition in unit disk graphs (Q2428685) (← 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)
- Latency Constrained Aggregation in Chain Networks Admits a PTAS (Q3638456) (← links)
