AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ (Q4820048): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3948568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of heuristics for the weighted matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case bounds for the Euclidean matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Evaluation of General Arithmetic Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Point Location in a Monotone Subdivision / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sweepline algorithm for Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Scaling Algorithms for Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding maximum matching in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of heuristic algorithms for weighted perfect matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound to the complexity of Euclidean and rectilinear matching algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for planar minimum‐weight perfect metchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time approximation algorithms for finding the minimum-weight perfect matching on a plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location of a Point in a Planar Subdivision and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the efficiency of transforming static data structures into dynamic structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal dynamization of decomposable searching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computation of matchings in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case optimal insertion and deletion methods for decomposable searching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some principles for dynamizing decomposable searching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic matching for graphs satisfying the triangle inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of divide‐and‐conquer heuristics for minimum weighted euclidean matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Greedy Heuristic for Complete Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection and Closest-Pair Problems for a Set of Planar Discs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Travelling Salesman Problem and Minimum Matching in the Unit Square / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry Helps in Matching / rank
 
Normal rank

Latest revision as of 14:29, 7 June 2024

scientific article; zbMATH DE number 2106654
Language Label Description Also known as
English
AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗
scientific article; zbMATH DE number 2106654

    Statements

    AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ (English)
    0 references
    0 references
    6 October 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references