Approximation and Online Algorithms
From MaRDI portal
Publication:5898479
DOI10.1007/11671411zbMath1177.68256OpenAlexW4210634114MaRDI QIDQ5898479
Zvi Gotthilf, Moshe Lewenstein
Publication date: 12 February 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11671411
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25)
Related Items
Locally searching for large induced matchings, Linear programming based approximation for unweighted induced matchings -- breaking the \(\varDelta\) barrier, Approximability results for the maximum and minimum maximal induced matching problems, Two greedy consequences for maximum induced matchings, Approximating weighted induced matchings, Maximum induced matching of hexagonal graphs, New kernels for several problems on planar graphs, The parameterized complexity of the induced matching problem
