Approximation algorithms for weighted matching

DOI10.1016/0304-3975(87)90022-3zbMath0643.68084OpenAlexW1998129956MaRDI QIDQ1102118

Shankar M. Venkatesan

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90022-3

zbMATH Keywords

Approximation algorithmsweighted matching

Mathematics Subject Classification ID

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

Related Items (3)

Parallel approximation algorithms for maximum weighted matching in general graphs ⋮ New approximation results on graph matching and related problems ⋮ Unnamed Item

Cites Work

• A separator theorem for graphs of bounded genus
• A Separator Theorem for Planar Graphs
• Applications of a Planar Separator Theorem
• On a Greedy Heuristic for Complete Matching
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximation algorithms for weighted matching