A Unified Framework of FPT Approximation Algorithms for Clustering Problems

ISAAC, pp. 172020.

Cited by: 0|Views4
EI

Abstract:

In this paper, we present a framework for designing FPT approximation algorithms for many k-clustering problems. Our results are based on a new technique for reducing search spaces. A reduced search space is a small subset of the input data that has the guarantee of containing k clients close to the facilities opened in an optimal solutio...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments