Skip To Main Content
Andree-Ovidiu Stef on Muck Rack

Andree-Ovidiu Stef

Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work. Claim your profile

Get in touch with Andree-Ovidiu

Contact Andree-Ovidiu, search articles and posts on X, monitor coverage, and track replies from one place.

Learn more about Muck Rack

Actions

Share this page

Is this you?

As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile

Articles

Computer Science > Computational Geometry

|
By de Berg, Ulrike Schmidt-Kraepelin, Andree-Ovidiu Stef
| arxiv.org
Computing a minimum-weight perfect matching for a point set $P$ in Euclidean space is a classic geometric optimization problem. We consider the problem in a dynamic setting, where pairs of points may be added to or removed from the set $P$. Our focus is on maintaining an approximately optimal solution without making too many changes to the solution.
Open in Who Shared Issue with article?
See all 1 articles