Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
1 answer
178 views

Planar eucliean bipartite matching with squared distances

This is probably a really stupid question, but suppose I have two sets of points in the plane $X$ and $Y$ each with cardinality $|X| = |Y| = n$. For any bipartite matching $M$ between $X$ and $Y$, ...
Mads Simonsen's user avatar
2 votes
1 answer
152 views

Graph immersed into the plane with segments as edges and we search for matching with no edges intersecting

There are some points in the plane and some of them are connected with segments between them. We look at this structure as a graph immersed into the plane where the points are the vertices and the ...
David Herskovics's user avatar