Pages that link to "Item:Q2958236"
From MaRDI portal
The following pages link to Approximation Algorithms for a Mixed Postman Problem with Restrictions on the Arcs (Q2958236):
Displaying 6 items.
- Parameterized complexity of the \(k\)-arc Chinese postman problem (Q340562) (← links)
- Postman problems on series-parallel mixed graphs (Q2183202) (← links)
- Parameterized Complexity of the k-Arc Chinese Postman Problem (Q2921440) (← links)
- A 3/2-Approximation Algorithm for the Mixed Postman Problem (Q4699169) (← links)
- Variants of the mixed postman problem solvable using linear programming (Q5248773) (← links)
- Approximation algorithms for some minimum postmen cover problems (Q5918771) (← links)