Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
175 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Improved Kernels for Tracking Path Problem (2001.03161v2)

Published 9 Jan 2020 in cs.DS

Abstract: Tracking of moving objects is crucial to security systems and networks. Given a graph $G$, terminal vertices $s$ and $t$, and an integer $k$, the \textsc{Tracking Paths} problem asks whether there exists at most $k$ vertices, which if marked as trackers, would ensure that the sequence of trackers encountered in each s-t path is unique. It is known that the problem is NP-hard and admits a kernel (reducible to an equivalent instance) with $\mathcal{O}(k6)$ vertices and $\mathcal{O}(k7)$ edges, when parameterized by the size of the output (tracking set) $k$ [5]. An interesting question that remains open is whether the existing kernel can be improved. In this paper we answer this affirmatively: (i) For general graphs, we show the existence of a kernel of size $\mathcal{O}(k2)$, (ii) For planar graphs, we improve this further by giving a kernel of size $\mathcal{O}(k)$. In addition, we also show that finding a tracking set of size at most $n-k$ for a graph on $n$ vertices is hard for the parameterized complexity class W[1], when parameterized by $k$.

Citations (7)

Summary

We haven't generated a summary for this paper yet.