Heuristics for planar minimum‐weight perfect metchings

DOI10.1002/net.3230130105zbMath0503.68050OpenAlexW2076088024MaRDI QIDQ3969883

Masao Iri, Shouichi Matsui, Kazuo Murota

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)

Related Items

New primal and dual matching heuristics, Euclidean matching problems and the metropolis algorithm, Linear-Time Approximation for Maximum Weight Matching, AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗, On the Euclidean assignment problem, Heuristic methods and applications: A categorized survey

Cites Work

• Subadditive Euclidean functionals and nonlinear growth in geometric probability