@article{oai:kyutech.repo.nii.ac.jp:00006230,
 author = {Asahiro,  Yuichi and Lin, Guohui and Liu, Zhilong and Miyano, Eiji and 宮野, 英次},
 issue = {9},
 journal = {IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences},
 month = {Sep},
 note = {In this paper, we investigate the maximum induced matching problem (MaxIM) on C5-free d-regular graphs. The previously known best approximation ratio for MaxIM on C5-free d-regular graphs is $\left(\frac{3d}{4}-\frac{1}{8}+\frac{3}{16d-8}\right)$. In this paper, we design a $\left(\frac{2d}{3}+\frac{1}{3}\right)$-approximation algorithm, whose approximation ratio is strictly smaller/better than the previous one when d≥6.},
 pages = {1142--1149},
 title = {An Approximation Algorithm for the Maximum Induced Matching Problem on C5-Free Regular Graphs},
 volume = {E102-A},
 year = {2019},
 yomi = {ミヤノ, エイジ}
}