Probing Convex polygons with half-planes
Journal of Algorithms
Journal of Algorithms
.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Load Balancing for Adaptive Multigrid Methods
SIAM Journal on Scientific Computing
Vertex cover: further observations and further improvements
Journal of Algorithms
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
A parallel rendezvous algorithm for interpolation between multiple grids
Journal of Parallel and Distributed Computing
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
On the rectangular subset closure of point sets
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
Algorithms for rectangular covering problems
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
| Hi-index | 0.00 |
Recently in [12] a deterministic worst-case upper bound was shown for the problem of covering a set of integer-coordinate points in the plane with axis-parallel rectgangles minimizing a certain objective function on rectangles. Because the rectangles have to meet a lower bound condition for their side lengths, this class of problems is termed 1-sided. The present paper is devoted to show that the bounds for solving this 1-sided problem class also hold for problem variants with 2-sided length constraints on coverings meaning that the rectangles are subjected also to an upper bound for side lengths. All these 2-sided variants are NP-hard. We also provide a generalization of the results to the d-dimensional case.