On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model

05/14/2018
by   Sergey Bereg, et al.
0

Given a set of n points P in the plane, each colored with one of the t given colors, a color-spanning set S⊂ P is a subset of t points with distinct colors. The minimum diameter color-spanning set (MDCS) is a color-spanning set whose diameter is minimum (among all color-spanning sets of P). Somehow symmetrically, the largest closest pair color-spanning set (LCPCS) is a color-spanning set whose closest pair is the largest (among all color-spanning sets of P). Both MDCS and LCPCS have been shown to be NP-complete, but whether they are fixed-parameter tractable (FPT) when t is a parameter is still open. Motivated by this question, we consider the FPT tractability of some matching problems under this color-spanning model, where t=2k is the parameter. The problems are summarized as follows: (1) MinSum Matching Color-Spanning Set, namely, computing a matching of 2k points with distinct colors such that their total edge length is minimized; (2) MaxMin Matching Color-Spanning Set, namely, computing a matching of 2k points with distinct colors such that the minimum edge length is maximized; (3) MinMax Matching Color-Spanning Set, namely, computing a matching of 2k points with distinct colors such that the maximum edge length is minimized; and (4) k-Multicolored Independent Matching, namely, computing a matching of 2k vertices in a graph such that the vertices of the edges in the matching do not share common edges in the graph. We show that the first three problems are polynomially solvable (hence in FPT), while problem (4) is W[1]-hard.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/29/2022

Minimum color spanning circle of imprecise points

Let R be a set of n colored imprecise points, where each point is colore...
research
09/27/2018

(g,f)-Chromatic spanning trees and forests

A heterochromatic (or rainbow) graph is an edge-colored graph whose edge...
research
09/07/2018

The Partition Spanning Forest Problem

Given a set of colored points in the plane, we ask if there exists a cro...
research
01/28/2022

Isomorphism testing of k-spanning tournaments is Fixed Parameter Tractable

An arc-colored tournament is said to be k-spanning for an integer k≥ 1 i...
research
05/13/2019

Color spanning Localized query

Let P be a set of n points and each of the points is colored with one of...
research
06/24/2022

Computing the Minimum Bottleneck Moving Spanning Tree

Given a set P of n points that are moving in the plane, we consider the ...
research
12/11/2017

How to navigate through obstacles?

Given a set of obstacles and two points, is there a path between the two...

Please sign up or login with your details

Forgot password? Click here to reset