Geometry Helps in Matching
From MaRDI portal
Publication:3034826
DOI10.1137/0218080zbMath0692.68042OpenAlexW2007052372MaRDI QIDQ3034826
Publication date: 1989
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0218080
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99)
Related Items (35)
An optimal algorithm for plane matchings in multipartite geometric graphs ⋮ New variants of perfect non-crossing matchings ⋮ A lower bound for approximating the geometric minimum weight matching ⋮ Improved Grid Map Layout by Point Set Matching ⋮ An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs ⋮ Efficient many-to-Many point matching in one dimension ⋮ Dynamic Euclidean minimum spanning trees and extrema of binary functions ⋮ Fast Property Testing and Metrics for Permutations ⋮ Using geometry to solve the transportation problem in the plane ⋮ Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications ⋮ Minimum weight euclidean matching and weighted relative neighborhood graphs ⋮ AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ ⋮ Optimally solving a transportation problem using Voronoi diagrams ⋮ Boundary labeling: Models and efficient algorithms for rectangular maps ⋮ A maximum \(b\)-matching problem arising from median location models with applications to the roommates problem ⋮ Geometry Helps to Compare Persistence Diagrams ⋮ Reprint of: Optimally solving a transportation problem using Voronoi diagrams ⋮ The Euclidean k-Supplier Problem ⋮ Boundary Labeling with Octilinear Leaders ⋮ Approximating the bottleneck plane perfect matching of a point set ⋮ Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications ⋮ An algorithm for curve identification in the presence of curve intersections ⋮ New variants of perfect non-crossing matchings ⋮ Hamiltonian triangulations and circumscribing polygons of disjoint line segments ⋮ Connected dominating sets on dynamic geometric graphs ⋮ Boundary labeling with octilinear leaders ⋮ Unnamed Item ⋮ One-dimensional service networks and batch service queues ⋮ On Map Labeling with Leaders ⋮ Minimum cost \(b\)-matching problems with neighborhoods ⋮ Approximation algorithms for lawn mowing and milling ⋮ Monochromatic plane matchings in bicolored point set ⋮ Unnamed Item ⋮ Shortest paths in intersection graphs of unit disks ⋮ Computing Euclidean bottleneck matchings in higher dimensions
This page was built for publication: Geometry Helps in Matching
