r-Gather Clustering and r-Gathering on Spider: FPT Algorithms and Hardness

07/09/2019
by   Soh Kumabe, et al.
0

We consider min-max r-gather clustering problem and min-max r-gathering problem. In the min-max r-gather clustering problem, we are given a set of users and divide them into clusters with size at least r; the goal is to minimize the maximum diameter of clusters. In the min-max r-gathering problem, we are additionally given a set of facilities and assign each cluster to a facility; the goal is to minimize the maximum distance between the users and the assigned facility. In this study, we consider the case that the users and facilities are located on a "spider" and propose the first fixed-parameter tractable (FPT) algorithms for both problems, which are parametrized by only the number of legs. Furthermore, we prove that these problems are NP-hard when the number of legs is arbitrarily large.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/05/2020

r-Gathering Problems on Spiders:Hardness, FPT Algorithms, and PTASes

We consider the min-max r-gathering problem described as follows: We are...
research
06/05/2023

Solving NP-hard Min-max Routing Problems as Sequential Generation with Equity Context

Min-max routing problems aim to minimize the maximum tour length among a...
research
11/14/2021

Area-Optimal Simple Polygonalizations: The CG Challenge 2019

We give an overview of theoretical and practical aspects of finding a si...
research
09/14/2023

Massively-Parallel Heat Map Sorting and Applications To Explainable Clustering

Given a set of points labeled with k labels, we introduce the heat map s...
research
12/14/2017

Approximation Algorithms for Replenishment Problems with Fixed Turnover Times

We introduce and study a class of optimization problems we coin replenis...
research
06/03/2019

On Romeo and Juliet Problems: Minimizing Distance-to-Sight

We introduce a variant of the watchman route problem, which we call the ...
research
02/06/2020

Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability

Improving the explainability of the results from machine learning method...

Please sign up or login with your details

Forgot password? Click here to reset