Pages that link to "Item:Q1196167"
From MaRDI portal
The following pages link to Tight integral duality gap in the Chinese postman problem (Q1196167):
Displaying 10 items.
- Primal-dual approximation algorithms for integral flow and multicut in trees (Q679443) (← links)
- Undirected distances and the postman-structure of graphs (Q1099186) (← links)
- Tight integral duality gap in the Chinese postman problem (Q1196167) (← links)
- On shortest \(T\)-joins and packing \(T\)-cuts (Q1210583) (← links)
- A fast algorithm for maximum integral two-commodity flow in planar graphs (Q1314324) (← links)
- Vertex set partitions preserving conservativeness (Q1850496) (← links)
- On the integral 4-packing of \(T\)-cuts (Q1896345) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- On complexity, representation and approximation of integral multicommodity flows (Q1962043) (← links)
- Integer plane multiflow maximisation: one-quarter-approximation and gaps (Q2089777) (← links)
