Pages that link to "Item:Q1365047"

The following pages link to Efficiently solvable special cases of hard combinatorial optimization problems (Q1365047):

Displaying 3 items.

• Using well-solvable minimum cost exact covering for VLSI clock energy minimization (Q1785247) (← links)
• The two-stripe symmetric circulant TSP is in P (Q2164712) (← links)
• Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem (Q5206234) (← links)