scientific article; zbMATH DE number 1003236
From MaRDI portal
Publication:4335196
zbMath0867.05071MaRDI QIDQ4335196
Peter N. Yianilos, Samuel R. Buss
Publication date: 1 June 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
convexitymatchingcomputational geometryassignmentEuclidean distancestring comparisonlinear-time algorithmMonge propertybipartite weighted matchingquadrangle inequalityconcave penalty functionedge costsminimum-cost matching
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Unshuffling a square is NP-hard ⋮ Perspectives of Monge properties in optimization ⋮ A linear time algorithm for a matching problem on the circle
