A strongly polynomial algorithm to solve combinatorial linear programs
Operations Research
A Partitioning Strategy for Nonuniform Problems on Multiprocessors
IEEE Transactions on Computers
Integer and combinatorial optimization
Integer and combinatorial optimization
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Partitioning Problems in Parallel, Pipeline, and Distributed Computing
IEEE Transactions on Computers
Approximation algorithms for hitting objects with straight lines
Discrete Applied Mathematics
Improved Algorithms for Mapping Pipelined and Parallel Computations
IEEE Transactions on Computers
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Rectilinear partitioning of irregular data parallel computations
Journal of Parallel and Distributed Computing
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Approximations for the General Block Distribution of a Matrix
SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
On the Complexity of the Generalized Block Distribution
IRREGULAR '96 Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Theoretical Computer Science
A unified approach to approximating partial covering problems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Optimization problems in multiple-interval graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
ACM Transactions on Algorithms (TALG)
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
On the parameterized complexity of multiple-interval graph problems
Theoretical Computer Science
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Latency Constrained Aggregation in Chain Networks Admits a PTAS
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Optimization problems in multiple-interval graphs
ACM Transactions on Algorithms (TALG)
Separating Multi-Color Points on a Plane with Fewest Axis-Parallel Lines
Fundamenta Informaticae
Approximation algorithms for capacitated rectangle stabbing
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Orthogonal subdivisions with low stabbing numbers
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Rounding to an integral program
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Fixed-Parameter algorithms for cochromatic number and disjoint rectangle stabbing
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Rounding to an integral program
Operations Research Letters
Load-balancing spatially located computations using rectangular partitions
Journal of Parallel and Distributed Computing
Information and Computation
Hi-index | 0.00 |
We provide constant ratio approximation algorithms for two NP-hard problems, the rectangle stabbing problem and the rectilinear partitioning problem. In the rectangle stabbing problem, we are given a set of rectangles in two-dimensional space, with the objective of stabbing all rectangles with the minimum number of lines parallel to the x and y axes. We provide a 2-approximation algorithm, while the best known approximation ratio for this problem is O(log n). This algorithm is then extended to a 4-approximation algorithm for the rectilinear partitioning problem, which, given an mx × my array of nonnegative integers and positive integers υ, h, asks to find a set of υ vertical and h horizontal lines such that the maximum load of a subrectangle (i.e., the sum of the numbers in it) is minimized. The best known approximation ratio for this problem is 27. Our approximation ratio 4 is close to the best possible, as it is known to be NP-hard to approximate within any factor less than 2. The results are then extended to the d-dimensional space for d ≥ 2, where a d-approximation algorithm for the stabbing problem and a dd-approximation algorithm for the partitioning problem are developed.