The following pages link to Miu Cost Tensions (Q3735408):
Displaying 6 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)
- Inessential tensions (Q1567038) (← 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)
