Pages that link to "Item:Q1372300"
From MaRDI portal
The following pages link to The computational complexity of Steiner tree problems in graded matrices (Q1372300):
Displaying 5 items.
- K-center and K-median problems in graded distances (Q1274996) (← links)
- The Steiner tree problem in Kalmanson matrices and in circulant matrices (Q1304385) (← 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)
- Classes of directed graded graphs with polynomially solvable cardinality Steiner problem (Q4522718) (← links)