Pages that link to "Item:Q1806599"

The following pages link to The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices (Q1806599):

Displaying 6 items.

• An algorithm for \(k^{\text{th}}\) minimum spanning tree (Q327676) (← links)
• K-center and K-median problems in graded distances (Q1274996) (← links)
• The computational complexity of Steiner tree problems in graded matrices (Q1372300) (← links)
• The quadratic minimum spanning tree problem and its variations (Q1662110) (← links)
• Local search algorithms for the \(k\)-cardinality tree problem. (Q1811129) (← links)
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)