Cover Image

Approximation Algorithms for Minimum Sum of Moving-Distance and Opening-Costs Target Coverage Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhao, Lei, Zhang, Zhao
Format:	Preprint
Published:	2024
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Stable Approximation Algorithms for Geometric Coverage Problems
by: de Berg, Mark, et al.
Published: (2024)

A Simple 2-Approximation Algorithm For Minimum Manhattan Network Problem
by: Sanim, Md. Musfiqur Rahman, et al.
Published: (2024)

Improved Algorithms for Distance Selection and Related Problems
by: Wang, Haitao, et al.
Published: (2023)

Approximate Hausdorff Distance for Multi-Vector Databases
by: Zhao, Dongfang
Published: (2025)

FPT Constant Approximation Algorithms for Colorful Sum of Radii
by: Liu, Shuilian, et al.
Published: (2025)

Approximate Algorithms for Chamfer Distance Under Translation
by: Halevi, Gil, et al.
Published: (2026)

Algorithms for Halfplane Coverage and Related Problems
by: Wang, Haitao, et al.
Published: (2024)

On The Computational Complexity of Minimum Aerial Photographs for Planar Region Coverage
by: Feng, Si Wei
Published: (2025)

Approximation Algorithms for the Freeze Tag Problem inside Polygons
by: Rajabi-Alni, Fatemeh, et al.
Published: (2024)

Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems
by: Har-Peled, Sariel, et al.
Published: (2014)

Approximating Gromov-Hausdorff Distance in Euclidean Space
by: Majhi, Sushovan, et al.
Published: (2019)

Exact Algorithms for Minimum Dilation Triangulation
by: Fekete, Sándor P., et al.
Published: (2025)

Approximating the Directed Hausdorff Distance
by: Chubet, Oliver A., et al.
Published: (2025)

Algorithms for Distance Problems in Continuous Graphs
by: Cabello, Sergio, et al.
Published: (2025)

Linear-Time $(1+\varepsilon)$-Approximation Algorithms for Two-Line-Center Problems
by: Chung, Chaeyoon, et al.
Published: (2026)

Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching
by: Hougardy, Stefan, et al.
Published: (2024)

On Saxe's theorems about the complexity of the Distance Geometry Problem
by: Kupperschmitt, Maël, et al.
Published: (2025)

Approximating 1-Wasserstein Distance between Persistence Diagrams by Graph Sparsification
by: Dey, Tamal K., et al.
Published: (2021)

Approximating Pareto Sum via Bounded Monotone Min-Plus Convolution
by: Gokaj, Geri, et al.
Published: (2026)

Efficient Exact Algorithms for Minimum Covering of Orthogonal Polygons with Squares
by: Dhar, Anubhav, et al.
Published: (2024)

FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
by: Grandoni, Fabrizio, et al.
Published: (2026)

Simple but not Simpler: A Surface-Sliding Method for Finding the Minimum Distance between Two Ellipsoids
by: Amirkhani, Dariush, et al.
Published: (2026)

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
by: Barequet, Gill, et al.
Published: (2025)

The Fréchet Distance Unleashed: Approximating a Dog with a Frog
by: Har-Peled, Sariel, et al.
Published: (2024)

Fast Algorithms for Minimum Homology Basis
by: Dhar, Amritendu, et al.
Published: (2021)

On a Geometric Interpretation Of the Subset Sum Problem
by: Costandin, Marius
Published: (2024)

An Improved Quasi-Physical Dynamic Algorithm for Efficient Circular Coverage in Arbitrary Convex
by: Yi, Zeping, et al.
Published: (2026)

Approximation Algorithms for Anchored Multiwatchman Routes
by: Mitchell, Joseph S. B., et al.
Published: (2024)

Empirical Analysis Of Heuristic and Approximation Algorithms for the The Mutual-Visibility Problem
by: Stojanović, Vanja, et al.
Published: (2025)

Constant Approximation of Fréchet Distance in Strongly Subquadratic Time
by: Cheng, Siu-Wing, et al.
Published: (2025)

Algorithms for the Shortest Vector Problem in $2$-dimensional Lattices, Revisited
by: Zhao, Lihao, et al.
Published: (2025)

Fast Approximation Algorithms for Piercing Boxes by Points
by: Agarwal, Pankaj K., et al.
Published: (2023)

Efficient Heuristic Algorithms for Interleaving Distance between Merge Trees
by: Touli, Elena Farahbakhsh, et al.
Published: (2025)

On the Line-Separable Unit-Disk Coverage and Related Problems
by: Liu, Gang, et al.
Published: (2023)

$L_1$-distortion of Earth Mover Distances and Transportation Cost Spaces on High Dimensional Grids
by: Gartland, Chris, et al.
Published: (2026)

New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
by: Banik, Aritra, et al.
Published: (2024)

Data Structures for Approximate Discrete Fréchet Distance
by: van der Hoog, Ivor, et al.
Published: (2022)

FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii
by: Bandyapadhyay, Sayan, et al.
Published: (2023)

On The Heine-Borel Property and Minimum Enclosing Balls
by: Banerjee, Hridhaan, et al.
Published: (2024)

On Approximability of $\ell_2^2$ Min-Sum Clustering
by: S., Karthik C., et al.
Published: (2024)