On the weighted Euclidean matching problem in Rd

DOI10.4064/AM28-2-5zbMATH Open1052.68055OpenAlexW2028163771MaRDI QIDQ4548943FDOQ4548943

Authors: Birgit Anthes, Ludger Rüschendorf 

Publication date: 27 August 2002

Published in: Applicationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/am28-2-5

Recommendations

• A partitioning algorithm for minimum weighted Euclidean matching
• Stochastic analysis of partitioning algorithms for matching problems
• Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances
• A lower bound to the complexity of Euclidean and rectilinear matching algorithms
• A Monte Carlo solution to the minimal Euclidean matching

zbMATH Keywords

probabilistic analysis of algorithmspartitioning algorithmEuclidean matching problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Strong limit theorems (60F15)

Cited In (8)

• A lower bound to the complexity of Euclidean and rectilinear matching algorithms
• The Euclidean \(k\)-supplier problem in \(\mathbb R^2\)
• Inexpensive d‐dimensional matchings
• Title not available (Why is that?)
• An Optimal Matching Problem for the Euclidean Distance
• Smoothed analysis of partitioning algorithms for Euclidean functionals
• A partitioning algorithm for minimum weighted Euclidean matching
• Partitioning heuristics for two geometric maximization problems

This page was built for publication: On the weighted Euclidean matching problem in R^d

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4548943)