An efficient sum query algorithm for distance-based locally dominating functions
From MaRDI portal
Publication:5136267
DOI10.4230/LIPICS.ISAAC.2017.47zbMATH Open1453.68064OpenAlexW2782820392MaRDI QIDQ5136267FDOQ5136267
Authors: Ziyun Huang, Jinhui Xu 
Publication date: 25 November 2020
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/8248/pdf/LIPIcs-ISAAC-2017-47.pdf/
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
- Concentration inequalities. A nonasymptotic theory of independence
- Probability Inequalities for Sums of Bounded Random Variables
- Approximate nearest neighbor: towards removing the curse of dimensionality
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- Optimal halfspace range reporting in three dimensions
- On coresets for k-means and k-median clustering
- On Approximating the Depth and Related Problems
- Title not available (Why is that?)
- A unified framework for approximating and clustering data
- Beyond locality-sensitive hashing
Cited In (1)
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)
