Moderately exponential time algorithms for the maximum induced matching problem

DOI10.1007/s11590-014-0813-zzbMath1327.90350MaRDI QIDQ2355320

Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung

Publication date: 22 July 2015

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-014-0813-z

zbMATH Keywords

approximation algorithm; induced matching; branch and reduce; measure and conquer

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C59: Approximation methods and heuristics in mathematical programming