Efficient algorithms for variants of weighted matching and assignment problems

DOI10.1007/s11786-007-0028-0zbMath1158.68034OpenAlexW2088839895MaRDI QIDQ942999

Satyajit Banerjee, Atish Datta Chowdhury, Subhas Kumar Ghosh

Publication date: 8 September 2008

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-007-0028-0

zbMATH Keywords

graph algorithmreductionapproximation algorithmmaximum weight maximum cardinality matching

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (2)

Short covering codes arising from matchings in weighted graphs ⋮ Short coverings and matching in weighted graphs

This page was built for publication: Efficient algorithms for variants of weighted matching and assignment problems