Multipacking in the Euclidean metric space

DOI10.1007/978-3-031-83438-7_10MaRDI QIDQ6969505zbMATH OpenFDO

Authors Arun Kumar Das, Sandip Das, Sk Samim Islam, Ritam Manna Mitra, Bodhayan Roy

Publication date 20 June 2025

Full work available at URL https://doi.org/10.1007/978-3-031-83438-7_10

zbMATH Keywords

geometric packingmultipackingnearest neighbor graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

Cites work

• A general model for the undesirable single facility location problem
• Broadcast domination and multipacking in strongly chordal graphs
• Combinatorial optimization. Packing and covering
• Discrete facility location and routing of obnoxious activities.
• Dynamic clustering to minimize the sum of radii
• scientific article; zbMATH DE number 7650282 (Why is no real title available?)
• Maximizing the number of obnoxious facilities to locate within a bounded region
• On approximation properties of the independent set problem for low degree graphs
• On nearest-neighbor graphs
• On the complexity of broadcast domination and multipacking in digraphs
• On the multipacking number of grid graphs
• Optimal binary space partitions for segments in the plane
• Relation between broadcast domination and multipacking numbers on chordal graphs
• Relations between packing and covering numbers of a tree
• Reliable and Efficient Computational Geometry Via Controlled Perturbation

This page was built for publication: Multipacking in the Euclidean metric space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969505)