The following pages link to (Q2934699):
Displaying 25 items.
- Unsplittable coverings in the plane (Q317324) (← links)
- Octants are cover-decomposable (Q411409) (← links)
- A constant factor approximation algorithm for the storage allocation problem (Q524369) (← links)
- Indecomposable coverings with concave polygons (Q603839) (← links)
- Decomposition of multiple coverings into more parts (Q603854) (← links)
- Energy efficient monitoring in sensor networks (Q627527) (← links)
- Optimally decomposing coverings with translates of a convex polygon (Q635757) (← links)
- Polychromatic coloring for half-planes (Q645968) (← links)
- Colorful strips (Q659707) (← links)
- Single and multiple device DSA problems, complexities and online algorithms (Q764370) (← links)
- Changing of the guards: strip cover with duty cycling (Q896691) (← links)
- Decomposition of multiple coverings into many parts (Q955226) (← links)
- Coloring geometric range spaces (Q1017922) (← links)
- On spectrum assignment in elastic optical tree-networks (Q1730219) (← links)
- ``Green'' barrier coverage with mobile sensors (Q1998844) (← links)
- Polychromatic colorings and cover decompositions of hypergraphs (Q2007510) (← links)
- Maximizing barrier coverage lifetime with static sensors (Q2093181) (← links)
- Polychromatic colorings of hypergraphs with high balance (Q2129929) (← links)
- Profit maximization in flex-grid all-optical networks (Q2300629) (← links)
- Average case network lifetime on an interval with adjustable sensing ranges (Q2345943) (← links)
- Set it and forget it: approximating the set once strip cover problem (Q2408917) (← links)
- Octants are cover-decomposable into many coverings (Q2444310) (← links)
- “Green” Barrier Coverage with Mobile Sensors (Q2947008) (← links)
- Maximizing Barrier Coverage Lifetime with Static Sensors (Q5056063) (← links)
- Maximizing Barrier Coverage Lifetime with Mobile Sensors (Q5346541) (← links)
