Pages that link to "Item:Q1356759"

The following pages link to A strongly polynomial algorithm for the minimum cost tension problem (Q1356759):

Displaying 6 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)
• Penelope's graph: a hard minimum cost tension instance (Q1127551) (← links)
• An analysis of the parameterized complexity of periodic timetabling (Q2142676) (← 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)