External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies

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]

Authors

Julien Baste

This author has not been identified. Look up 'Julien Baste' in Google

Maximilian Fürst

This author has not been identified. Look up 'Maximilian Fürst' in Google

Dieter Rautenbach

This author has not been identified. Look up 'Dieter Rautenbach' in Google
runs on