Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Removing Connected Obstacles in the Plane is FPT (2002.01218v1)

Published 4 Feb 2020 in cs.DS, cs.CG, and cs.DM

Abstract: Given two points in the plane, a set of obstacles defined by closed curves, and an integer $k$, does there exist a path between the two designated points intersecting at most $k$ of the obstacles? This is a fundamental and well-studied problem arising naturally in computational geometry, graph theory, wireless computing, and motion planning. It remains $\textsf{NP}$-hard even when the obstacles are very simple geometric shapes (e.g., unit-length line segments). In this paper, we show that the problem is fixed-parameter tractable ($\textsf{FPT}$) parameterized by $k$, by giving an algorithm with running time $k{O(k3)}n{O(1)}$. Here $n$ is the number connected areas in the plane drawing of all the obstacles.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Eduard Eiben (54 papers)
  2. Daniel Lokshtanov (135 papers)
Citations (4)

Summary

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