Pages that link to "Item:Q1372300"

The following pages link to The computational complexity of Steiner tree problems in graded matrices (Q1372300):

Displaying 3 items.

• K-center and K-median problems in graded distances (Q1274996) (← links)
• The quadratic minimum spanning tree problem and its variations (Q1662110) (← links)
• The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices (Q1806599) (← links)