scientific article
From MaRDI portal
Publication:2934699
zbMath1302.68278MaRDI QIDQ2934699
Shaili Jain, Suresh Venkatasubramanian, Ke Yi, Alon Efrat, Adam L. Buchsbaum
Publication date: 18 December 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (25)
Polychromatic colorings of hypergraphs with high balance ⋮ Maximizing Barrier Coverage Lifetime with Static Sensors ⋮ Unsplittable coverings in the plane ⋮ Indecomposable coverings with concave polygons ⋮ Decomposition of multiple coverings into more parts ⋮ Set it and forget it: approximating the set once strip cover problem ⋮ “Green” Barrier Coverage with Mobile Sensors ⋮ Changing of the guards: strip cover with duty cycling ⋮ Octants are cover-decomposable ⋮ Energy efficient monitoring in sensor networks ⋮ Optimally decomposing coverings with translates of a convex polygon ⋮ Polychromatic coloring for half-planes ⋮ Octants are cover-decomposable into many coverings ⋮ Colorful strips ⋮ On spectrum assignment in elastic optical tree-networks ⋮ Decomposition of multiple coverings into many parts ⋮ A constant factor approximation algorithm for the storage allocation problem ⋮ ``Green barrier coverage with mobile sensors ⋮ Polychromatic colorings and cover decompositions of hypergraphs ⋮ Profit maximization in flex-grid all-optical networks ⋮ Coloring geometric range spaces ⋮ Single and multiple device DSA problems, complexities and online algorithms ⋮ Maximizing barrier coverage lifetime with static sensors ⋮ Average case network lifetime on an interval with adjustable sensing ranges ⋮ Maximizing Barrier Coverage Lifetime with Mobile Sensors
This page was built for publication:
