Approximate minimum weight matching on points in k-dimensional space (Q1825658): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster scaling algorithms for general graph matching 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: Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:19, 20 June 2024

scientific article
Language Label Description Also known as
English
Approximate minimum weight matching on points in k-dimensional space
scientific article

    Statements

    Approximate minimum weight matching on points in k-dimensional space (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    0 references
    0 references
    0 references
    0 references
    geometric matching
    0 references
    approximation algorithms
    0 references
    minimum weight complete matching
    0 references