Pages that link to "Item:Q1003668"

The following pages link to Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width (Q1003668):

Displaying 7 items.

• Parameterized complexity of the \(k\)-arc Chinese postman problem (Q340562) (← links)
• Lane covering with partner bounds in collaborative truckload transportation procurement (Q1652017) (← links)
• Minimum constellation covers: hardness, approximability and polynomial cases (Q2025056) (← links)
• Postman problems on series-parallel mixed graphs (Q2183202) (← links)
• Series-parallel graphs are windy postman perfect (Q2476276) (← links)
• The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth (Q2835842) (← links)
• Structural Parameterizations of the Mixed Chinese Postman Problem (Q3452829) (← links)