Probabilistic Analysis of a Greedy Heuristic for Euclidean Matching (Q3415878): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Decomposable searching problems I. Static-to-dynamic transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / 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 Existence of Probability Measures with Given Marginals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal triangulation of random samples in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subadditive Euclidean functionals and nonlinear growth in geometric probability / 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: Probabilistic analysis of divide‐and‐conquer heuristics for minimum weighted euclidean matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane / 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

Latest revision as of 12:42, 25 June 2024

scientific article
Language Label Description Also known as
English
Probabilistic Analysis of a Greedy Heuristic for Euclidean Matching
scientific article

    Statements

    Identifiers