1 citations · 1 across the 4 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.CG2020
Rectangle Tiling Binary Arrays
Pratik Ghosal, Syed Mohammad Meesum, Katarzyna Paluch
The problem of rectangle tiling binary arrays is defined as follows. Given an array of zeros and ones and a natural number , our task is to partition into a…
cs.DS2020
Dense Steiner problems: Approximation algorithms and inapproximability
Marek Karpinski, Mateusz Lewandowski, Syed Mohammad Meesum +1
The Steiner Tree problem is a classical problem in combinatorial optimization: the goal is to connect a set of terminals in a graph by a tree of minimum size. Karpinski and…