The bound coverage problem by aligned disks in \(L_1\) metric

DOI10.1007/978-3-031-22105-7_27MaRDI QIDQ6113856

Zhonghao Liu, Xiaofei Liu

Publication date: 10 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

boundfully polynomial time approximation schemedisk coverage problem

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
• A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem
• A primal-dual algorithm for the minimum power partial cover problem
• Online bottleneck semi-matching
• A note on the minimum power partial cover problem on the plane
• Polynomial time approximation schemes for base station coverage with minimum total radii
• Minimum power partial multi-cover on a line
• Approximation algorithms for the minimum power cover problem with submodular/linear penalties
• The coverage problem by aligned disks
• The Prize-collecting Call Control Problem on Weighted Lines and Rings
• Algorithms for Scheduling Independent Tasks
• Algorithms – ESA 2005
• Approximation and Online Algorithms
• Max-min dispersion on a line

This page was built for publication: The bound coverage problem by aligned disks in \(L_1\) metric