Pages that link to "Item:Q4630249"

The following pages link to Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover (Q4630249):

Displaying 3 items.

• Approximations for the disjoint paths problem in high-diameter planar networks (Q1273862) (← links)
• On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints (Q1975964) (← links)
• Multiway cuts in directed and node weighted graphs (Q4632450) (← links)