Pages that link to "Item:Q442108"

The following pages link to An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem (Q442108):

Displaying 5 items.

• New algorithms for convex cost tension problem with application to computer vision (Q1040084) (← links)
• Penelope's graph: a hard minimum cost tension instance (Q1127551) (← links)
• A strongly polynomial algorithm for the minimum cost tension problem (Q1356759) (← 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)