Author

R. Staněk

h-index 12 View on Semantic Scholar

We have 1 of 70 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

A new O(n log n) approach for the Euclidean maximum weight matching problem

A novel algorithm for solving the Euclidean MWM running in $O(n \log n)$ time and providing excellent solution quality, especially for larger instances; the algorithm yielded optimum or near-optimum solutions for all test instances.

R. Staněk, Robert Arustamyan · 0 citations