Julien Baste, Maximilian Fürst, Dieter Rautenbach. Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies. In Donghyun Kim 0001, R. N. Uma, Zhipeng Cai 0001, Dong Hoon Lee 0001, editors, Computing and Combinatorics - 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings. Volume 12273 of Lecture Notes in Computer Science, pages 542-553, Springer, 2020. [doi]
@inproceedings{BasteFR20,
title = {Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies},
author = {Julien Baste and Maximilian Fürst and Dieter Rautenbach},
year = {2020},
doi = {10.1007/978-3-030-58150-3_44},
url = {https://doi.org/10.1007/978-3-030-58150-3_44},
researchr = {https://researchr.org/publication/BasteFR20},
cites = {0},
citedby = {0},
pages = {542-553},
booktitle = {Computing and Combinatorics - 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings},
editor = {Donghyun Kim 0001 and R. N. Uma and Zhipeng Cai 0001 and Dong Hoon Lee 0001},
volume = {12273},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-58150-3},
}