Algorithms and Computation

DOI10.1007/11602613zbMath1144.68336OpenAlexW2304246803MaRDI QIDQ5897844

Irit Katriel, Meena Mahajan, Khaled M. Elbassioni, Martin Kuetz

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 graphNP-completenessmatchingsoptimisationconstraint programmingperfect matchingshardness of approximation

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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (3)

Global constraint catalogue: past, present and future ⋮ A polyhedral approach to the \textit{alldifferent} system ⋮ Commitment under uncertainty: Two-stage stochastic matching problems

This page was built for publication: Algorithms and Computation