Pages that link to "Item:Q2410039"
From MaRDI portal
The following pages link to A faster strongly polynomial time algorithm to solve the minimum cost tension problem (Q2410039):
Displaying 4 items.
- An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem (Q442108) (← links)
- Penelope's graph: a hard minimum cost tension instance (Q1127551) (← links)
- A strongly polynomial algorithm for the minimum cost tension problem (Q1356759) (← links)
- An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem (Q2424659) (← links)
