An efficient sum query algorithm for distance-based locally dominating functions
From MaRDI portal
Recommendations
- An efficient sum query algorithm for distance-based locally dominating functions
- An efficient algorithm for solving the partial sum query problem
- Local search approximation algorithms for the sum of squares facility location problems
- An Efficient Local Search for the Minimum Independent Dominating Set Problem
- An efficient algorithm for distance total domination in block graphs
- Distance-k locating-dominating sets in graphs
- Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes
- Algorithmic results on locating-total domination in graphs
- Revisiting connected dominating sets: an optimal local algorithm?
- A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets
Cites work
- A unified framework for approximating and clustering data
- Approximate nearest neighbor: towards removing the curse of dimensionality
- Beyond locality-sensitive hashing
- Concentration inequalities. A nonasymptotic theory of independence
- scientific article; zbMATH DE number 5019895 (Why is no real title available?)
- On Approximating the Depth and Related Problems
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- On coresets for k-means and k-median clustering
- Optimal halfspace range reporting in three dimensions
- Probability Inequalities for Sums of Bounded Random Variables
This page was built for publication: An efficient sum query algorithm for distance-based locally dominating functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136267)
