VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION
DOI10.1142/S0129054108005747zbMATH Open1155.68015MaRDI QIDQ3526982FDOQ3526982
Authors: Sasanka Roy, Sandip Das, Gautam K. Das, Subhas C. Nandy 
Publication date: 25 September 2008
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
- Base station placement on boundary of a convex polygon
- Distributed Computing – IWDC 2005
- Efficient algorithm for placing a given number of base stations to cover a convex region
- scientific article; zbMATH DE number 2089212
- Polynomial time approximation schemes for base station coverage with minimum total radii
Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25) Network design and communication in computer systems (68M10) Discrete location and assignment (90B80)
Cites Work
- A Best Possible Heuristic for the k-Center Problem
- A near-linear algorithm for the planar 2-center problem
- A heuristic for the p-center problem in graphs
- The searching over separators strategy to solve some NP-hard problems in subexponential time
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- More planar two-center algorithms
- Title not available (Why is that?)
- Polynomial time approximation schemes for base station coverage with minimum total radii
Cited In (18)
- Title not available (Why is that?)
- Covering convex polygons by two congruent disks
- Covering convex polygons by two congruent disks
- Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
- Base station placement on boundary of a convex polygon
- THE ALIGNED K-CENTER PROBLEM
- Constrained \(k\)-center problem on a convex polygon
- Solving the natural wireless localization problem to optimality efficiently
- An incremental version of the \(k\)-center problem on boundary of a convex polygon
- Efficient algorithm for placing a given number of base stations to cover a convex region
- Worst-case optimal covering of rectangles by disks
- The Euclidean \(k\)-supplier problem in \(I R^2\)
- Distributed Computing – IWDC 2005
- Range assignment of base-stations maximizing coverage area without interference
- An approximation algorithm for \(k\)-center problem on a convex polygon
- Base Location Problems for Base-Monotone Regions
- The connected disk covering problem
- Title not available (Why is that?)
Uses Software
This page was built for publication: VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3526982)
