Pages that link to "Item:Q1775289"
From MaRDI portal
The following pages link to Minimum convex piecewise linear cost tension problem on quasi-\(k\) series-parallel graphs (Q1775289):
Displaying 4 items.
- An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem (Q442108) (← links)
- Aggregation approach for the minimum binary cost tension problem (Q1015014) (← links)
- A faster strongly polynomial time algorithm to solve the minimum cost tension problem (Q2410039) (← links)
- An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem (Q2424659) (← links)
