Two-best solutions under distance constraints: The model and exemplary results for matroids (Q1291060)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1295413
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-best solutions under distance constraints: The model and exemplary results for matroids |
scientific article; zbMATH DE number 1295413 |
Statements
Two-best solutions under distance constraints: The model and exemplary results for matroids (English)
0 references
11 October 1999
0 references
The authors investigate \(k\)-best questions with distance constraints \((k=2)\), deriving several results for valuated matroids. As a distance function on the set of all bases in a matroid the following function is taken: \(d(B_1, B_2)= {1\over 2}[\text{card}(B_1\setminus B_2)+ \text{card}(B_2\setminus B_1)]\). Two examples with maximum spanning trees in a medium size graph are discussed together with several ideas on \(k\)-best solutions.
0 references
orientable matroid
0 references
valuated matroids
0 references
distance function
0 references
0 references
0.8486571907997131
0 references
0.7962175011634827
0 references
0.776202917098999
0 references
