An FPT algorithm for orthogonal buttons and scissors

Dekel Tsur

doi:10.1016/j.ipl.2020.105997

An FPT algorithm for orthogonal buttons and scissors

Dekel Tsur

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

We study the puzzle game Buttons and Scissors in which the goal is to remove all buttons from an n×m grid by a series of horizontal and vertical cuts. We show that the corresponding decision problem has an algorithm with time complexity 2^{O(k²log⁡k)}+(n+m)^O(1), where k is an upper bound on the number of cuts.

Original language	English
Article number	105997
Number of pages	7
Journal	Information Processing Letters
Volume	163
DOIs	https://doi.org/10.1016/j.ipl.2020.105997
State	Published - 1 Nov 2020

Keywords

Algorithms
Keywords Combinatorial puzzles
Parameterized complexity
Reduction rules

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/j.ipl.2020.105997

Cite this

@article{b7b6bc790f9d4cd5a0fc2d4f89eb7bc8,

title = "An FPT algorithm for orthogonal buttons and scissors",

abstract = "We study the puzzle game Buttons and Scissors in which the goal is to remove all buttons from an n×m grid by a series of horizontal and vertical cuts. We show that the corresponding decision problem has an algorithm with time complexity 2O(k2log⁡k)+(n+m)O(1), where k is an upper bound on the number of cuts.",

keywords = "Algorithms, Keywords Combinatorial puzzles, Parameterized complexity, Reduction rules",

author = "Dekel Tsur",

note = "Publisher Copyright: {\textcopyright} 2020 Elsevier B.V.",

year = "2020",

month = nov,

day = "1",

doi = "10.1016/j.ipl.2020.105997",

language = "English",

volume = "163",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - An FPT algorithm for orthogonal buttons and scissors

AU - Tsur, Dekel

PY - 2020/11/1

Y1 - 2020/11/1

N2 - We study the puzzle game Buttons and Scissors in which the goal is to remove all buttons from an n×m grid by a series of horizontal and vertical cuts. We show that the corresponding decision problem has an algorithm with time complexity 2O(k2log⁡k)+(n+m)O(1), where k is an upper bound on the number of cuts.

AB - We study the puzzle game Buttons and Scissors in which the goal is to remove all buttons from an n×m grid by a series of horizontal and vertical cuts. We show that the corresponding decision problem has an algorithm with time complexity 2O(k2log⁡k)+(n+m)O(1), where k is an upper bound on the number of cuts.

KW - Algorithms

KW - Keywords Combinatorial puzzles

KW - Parameterized complexity

KW - Reduction rules

UR - http://www.scopus.com/inward/record.url?scp=85089383507&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2020.105997

DO - 10.1016/j.ipl.2020.105997

M3 - Article

AN - SCOPUS:85089383507

SN - 0020-0190

VL - 163

JO - Information Processing Letters

JF - Information Processing Letters

M1 - 105997

ER -

An FPT algorithm for orthogonal buttons and scissors

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this