Author:
Baste Julien,Fürst Maximilian,Rautenbach Dieter
Publisher
Springer International Publishing
Reference22 articles.
1. Baste, J., Fürst, M., Rautenbach, D.: Linear programming based approximation for unweighted induced matchings - breaking the $$\varDelta $$ barrier. arXiv:1812.05930
2. Baste, J., Rautenbach, D.: Degenerate matchings and edge colorings. Discret. Appl. Math. 239, 38–44 (2018)
3. Cameron, K., Walker, T.: The graphs with maximum induced matching and maximum matching the same size. Discret. Math. 299, 49–55 (2005)
4. Chalermsook, P., Laekhanukit, B., Nanongkai, D.: Independent set, induced matching, and pricing: connections and tight (subexponential time) approximation hardnesses. In: Proceedings of the 54th Annual Symposium on Foundations of Computer Science, FOCS ’13, pp. 370–379 (2013)
5. Duckworth, W., Manlove, D.F., Zito, M.: On the approximability of the maximum induced matching problem. J. Discret. Algorithms 3, 79–91 (2005)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献