Geometry Helps in Matching
From MaRDI portal
Recommendations
- Approximate minimum weight matching on points in k-dimensional space
- Fast Matching Algorithms for Points on a Polygon
- An EP Algorithm for Computing a Minimum Weight Perfect Matching for a Set of Points on the Plane
- Approximation algorithms for bipartite matching with metric and geometric costs
- Bipartite graph matching for points on a line or a circle
Cited in
(52)- A lower bound to the complexity of Euclidean and rectilinear matching algorithms
- Hamiltonian triangulations and circumscribing polygons of disjoint line segments
- Dynamic Euclidean minimum spanning trees and extrema of binary functions
- A maximum b-matching problem arising from median location models with applications to the roommates problem
- Computing Euclidean bottleneck matchings in higher dimensions
- An optimal algorithm for plane matchings in multipartite geometric graphs
- An algorithm for curve identification in the presence of curve intersections
- Approximate minimum weight matching on points in k-dimensional space
- Approximation algorithms for lawn mowing and milling
- Using geometry to solve the transportation problem in the plane
- One-dimensional service networks and batch service queues
- Minimum cost b-matching problems with neighborhoods
- Two dimensional maximum weight matching using Manhattan topology
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- Monochromatic plane matchings in bicolored point set
- Shortest paths in intersection graphs of unit disks
- Efficient many-to-Many point matching in one dimension
- A lower bound for approximating the geometric minimum weight matching
- Fast property testing and metrics for permutations
- An O(n^2) algorithm for the limited-capacity many-to-many point matching in one dimension
- Improved Grid Map Layout by Point Set Matching
- An optimal algorithm for plane matchings in multipartite geometric graphs
- Boundary Labeling with Octilinear Leaders
- On Map Labeling with Leaders
- Bipartite graph matching for points on a line or a circle
- On bipartite matchings of minimum density
- Reprint of: Optimally solving a transportation problem using Voronoi diagrams
- Fast Matching Algorithms for Points on a Polygon
- An EP Algorithm for Computing a Minimum Weight Perfect Matching for a Set of Points on the Plane
- Geometry helps to compare persistence diagrams
- AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗
- scientific article; zbMATH DE number 1431747 (Why is no real title available?)
- Minimum many-to-many matchings for computing the distance between two sequences
- Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications
- Minimum weight euclidean matching and weighted relative neighborhood graphs
- Efficient algorithms for geometric partial matching
- The Euclidean k-supplier problem
- Algorithms for the transportation problem in geometric settings
- New variants of perfect non-crossing matchings
- Computing fair and bottleneck matchings in geometric graphs
- A data-dependent approach for high-dimensional (robust) Wasserstein alignment
- Dynamic Euclidean bottleneck matching
- Fine-grained complexity of Earth mover's distance under translation
- An o(n n)-time approximation scheme for geometric many-to-many matching
- Connected dominating sets on dynamic geometric graphs
- Fast approximation algorithms for Euclidean minimum weight perfect matching
- Fast approximation algorithms for Euclidean minimum weight perfect matching
- Geometric bipartite matching based exact algorithms for server problems
- New variants of perfect non-crossing matchings
- Boundary labeling: Models and efficient algorithms for rectangular maps
- Approximating the bottleneck plane perfect matching of a point set
- Boundary labeling with octilinear leaders
This page was built for publication: Geometry Helps in Matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3034826)
