Algorithms and Computation

DOI10.1007/11602613zbMath1175.68203OpenAlexW2304246803MaRDI QIDQ5897925

Jérôme Monnot

Publication date: 14 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11602613

zbMATH Keywords

bipartite graphsapproximate algorithmslabeled matchingP-completecolored matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (3)

Bi-criteria and approximation algorithms for restricted matchings ⋮ A note on the hardness results for the labeled perfect matching problems in bipartite graphs ⋮ The labeled maximum matching problem

This page was built for publication: Algorithms and Computation