A Massively Parallel Dynamic Programming for Approximate Rectangle Escape Problem
S Aghamolaei, M Ghodsi - arxiv preprint arxiv:2309.00242, 2023 - arxiv.org
Sublinear time complexity is required by the massively parallel computation (MPC) model.
Breaking dynamic programs into a set of sparse dynamic programs that can be divided …
Breaking dynamic programs into a set of sparse dynamic programs that can be divided …
On the Hardness of Some Geometric Optimization Problems with Rectangles
S Pandit - … : 13th International Conference, COCOA 2019, **amen …, 2019 - Springer
Abstract We study the Set Cover, Hitting Set, Piercing Set, Independent Set, Dominating Set
problems, and discrete versions (Discrete Independent Set and Discrete Dominating Set) for …
problems, and discrete versions (Discrete Independent Set and Discrete Dominating Set) for …