scientific article; zbMATH DE number 6381738
From MaRDI portal
Publication:2934699
zbMATH Open1302.68278MaRDI QIDQ2934699FDOQ2934699
Authors: Shaili Jain, Suresh Venkatasubramanian, Ke Yi, Adam L. Buchsbaum, Alon Efrat 
Publication date: 18 December 2014
Title of this publication is not available (Why is that?)
Recommendations
- Decomposing coverings and the planar sensor cover problem
- A better approximation ratio and an IP formulation for a sensor cover problem
- On the number and arrangement of sensors for the multiple covering of bounded plane domains
- Constant-approximation for minimum weight partial sensor cover
- A robust sensor covering and communication problem
- Sensor networks and covering of plane by discs
- Complexity of barrier coverage with relocatable sensors in the plane
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cited In (28)
- Polychromatic colorings and cover decompositions of hypergraphs
- Energy efficient monitoring in sensor networks
- Polychromatic coloring for half-planes
- ``Green barrier coverage with mobile sensors
- ``Green barrier coverage with mobile sensors
- Radar placement along banks of river
- On spectrum assignment in elastic optical tree-networks
- Octants are cover-decomposable
- Decomposition of multiple coverings into more parts
- Indecomposable coverings with concave polygons
- Optimally decomposing coverings with translates of a convex polygon
- A fast localized algorithm for scheduling sensors
- Changing of the guards: strip cover with duty cycling
- Decomposition of multiple coverings into many parts
- A better approximation ratio and an IP formulation for a sensor cover problem
- Single and multiple device DSA problems, complexities and online algorithms
- Average case network lifetime on an interval with adjustable sensing ranges
- Polychromatic colorings of hypergraphs with high balance
- Maximizing Barrier Coverage Lifetime with Static Sensors
- Colorful strips
- Maximizing Barrier Coverage Lifetime with Mobile Sensors
- Profit maximization in flex-grid all-optical networks
- Changing of the guards: strip cover with duty cycling
- Set it and forget it: approximating the set once strip cover problem
- Octants are cover-decomposable into many coverings
- Coloring geometric range spaces
- Maximizing barrier coverage lifetime with static sensors
- A constant factor approximation algorithm for the storage allocation problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934699)
