Dispersing facilities on planar segment and circle amidst repulsion
From MaRDI portal
Publication:6112004
DOI10.1007/978-3-031-22050-0_10arXiv2205.03651MaRDI QIDQ6112004
Manjanna Basappa, Vishwanath R. Singireddy
Publication date: 4 August 2023
Published in: Journal of Global Optimization, Algorithmics of Wireless Networks (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.03651
dynamic programmingcontinuous locationparametric searchapproximation schemeobnoxious facility locationsegment treecontinuous facility location
Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Approximation algorithms (68W25) Artificial intelligence for robotics (68T40) Wireless sensor networks as related to computer science (68M18)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem
- Maximizing the number of obnoxious facilities to locate within a bounded region
- Improved algorithms for placing undesirable facilities
- Review of obnoxious facilities location problems
- Generalized Selection and Ranking: Sorted Matrices
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Approximation schemes for covering and packing problems in image processing and VLSI
- Obnoxious Facility Location on Graphs
- Applications of Parametric Searching in Geometric Optimization
- Slowing down sorting networks to obtain faster sorting algorithms
- THE LARGEST EMPTY ANNULUS PROBLEM
- Maximum-width empty square and rectangular annulus
- Dispersing facilities on planar segment and circle amidst repulsion
