Computational geometry: an introduction
Computational geometry: an introduction
Some parallel algorithms on interval graphs
Discrete Applied Mathematics
SIAM Journal on Computing
Analysis and Design of Parallel Algorithms: Arithmetic and Matrix Problems
Analysis and Design of Parallel Algorithms: Arithmetic and Matrix Problems
A Time- and Cost-Optimal Algorithm for Interlocking Sets-With Applications
IEEE Transactions on Parallel and Distributed Systems
An optimal parallel algorithm for all-pairs shortest paths on unweighted interval graphs
Nordic Journal of Computing
Bounded size dictionary compression: SCk -completeness and NC algorithms
Information and Computation
A linear-time algorithm to compute a MAD tree of an interval graph
Information Processing Letters
A parallel dual-type algorithm for a class of quadratic programming problems and applications
Expert Systems with Applications: An International Journal
Some variations on constrained minimum enclosing circle problem
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
| Hi-index | 0.00 |
A family of intervals on the real line provides a natural model for a vast number of scheduling and VLSI problems. Recently, a number of parallel algorithms to solve a variety of practical problems on such a family of intervals have been proposed in the literature. The authors develop computational tools and show how they can be used for the purpose of devising cost-optimal parallel algorithms for a number of interval-related problems, including finding a largest subset of pairwise nonoverlapping intervals, a minimum dominating subset of intervals, along with algorithms to compute the shortest path between a pair of intervals and, based on the shortest path, a parallel algorithm to find the center of the family of intervals. More precisely, with an arbitrary family of n intervals as input, all the algorithms run in O(log n) time using O(n) processors in the EREW-PRAM model of computation.