Heuristics for planar minimum‐weight perfect metchings

DOI10.1002/NET.3230130105zbMATH Open0503.68050OpenAlexW2076088024MaRDI QIDQ3969883FDOQ3969883

Authors: Masao Iri, Kazuo Murota, Shouichi Matsui 

Publication date: 1983

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230130105

zbMATH Keywords

linear-time approximation algorithmsworst- and average-case behaviors

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Subadditive Euclidean functionals and nonlinear growth in geometric probability

Cited In (6)

• Euclidean matching problems and the metropolis algorithm
• AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗
• Heuristic methods and applications: A categorized survey
• Linear-time approximation for maximum weight matching
• On the Euclidean assignment problem
• New primal and dual matching heuristics

This page was built for publication: Heuristics for planar minimum‐weight perfect metchings

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