scientific article
From MaRDI portal
Publication:3862427
zbMath0426.68047MaRDI QIDQ3862427
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
analysis of algorithmsworst case resultsgreedy-type heuristicsweighted matching problem in complete graphs
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (4)
Linear-Time Approximation for Maximum Weight Matching ⋮ Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck ⋮ Worst case bounds for the Euclidean matching problem ⋮ Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems
This page was built for publication:
