AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗
From MaRDI portal
Publication:4820048
DOI10.1080/10637199408915464zbMath1049.68924MaRDI QIDQ4820048
Selim G. Akl, Constantine N. K. Osiakwan
Publication date: 6 October 2004
Published in: Parallel Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10637199408915464
68W10: Parallel algorithms in computer science
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lower bound to the complexity of Euclidean and rectilinear matching algorithms
- A sweepline algorithm for Voronoi diagrams
- Some principles for dynamizing decomposable searching problems
- Worst case bounds for the Euclidean matching problem
- Worst-case optimal insertion and deletion methods for decomposable searching problems
- Linear-time approximation algorithms for finding the minimum-weight perfect matching on a plane
- Optimal dynamization of decomposable searching problems
- Parallel computation of matchings in trees
- Efficient parallel algorithms for graph problems
- Geometry Helps in Matching
- A survey of heuristics for the weighted matching problem
- Heuristic matching for graphs satisfying the triangle inequality
- Intersection and Closest-Pair Problems for a Set of Planar Discs
- Optimal Point Location in a Monotone Subdivision
- Efficient algorithms for finding maximum matching in graphs
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- A new class of heuristic algorithms for weighted perfect matching
- On a Greedy Heuristic for Complete Matching
- Lower bounds on the efficiency of transforming static data structures into dynamic structures
- Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching
- The Travelling Salesman Problem and Minimum Matching in the Unit Square
- Heuristics for planar minimum‐weight perfect metchings
- Probabilistic analysis of divide‐and‐conquer heuristics for minimum weighted euclidean matching
- Location of a Point in a Planar Subdivision and Its Applications
- The Parallel Evaluation of General Arithmetic Expressions
- Faster Scaling Algorithms for Network Problems
