Pages that link to "Item:Q974982"

The following pages link to Simpler analysis of LP extreme points for traveling salesman and survivable network design problems (Q974982):

Displaying 3 items.

• Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
• Socially fair network design via iterative rounding (Q2084030) (← links)
• A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)