Linear and Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours (Q4388868): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 16:39, 5 March 2024
scientific article; zbMATH DE number 1150633
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear and Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours |
scientific article; zbMATH DE number 1150633 |
Statements
Linear and Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours (English)
0 references
10 May 1998
0 references
assignment problem
0 references
bipartite weighted matching
0 references
computational geometry
0 references
concave penalty function
0 references
convexity
0 references
linear time
0 references
Monge property
0 references
quadrangle inequality
0 references
string comparison
0 references
symmetric cost function
0 references
matching
0 references
time complexity
0 references
