Pages that link to "Item:Q3057092"

The following pages link to Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding (Q3057092):

Displaying 18 items.

• Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
• Dual-based approximation algorithms for cut-based network connectivity problems (Q722530) (← links)
• Simpler analysis of LP extreme points for traveling salesman and survivable network design problems (Q974982) (← links)
• Sparse certificates for 2-connectivity in directed graphs (Q1676306) (← links)
• On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem (Q1789587) (← links)
• The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm (Q2191772) (← links)
• Bulk-robust combinatorial optimization (Q2515045) (← links)
• Box-total dual integrality and edge-connectivity (Q2689821) (← links)
• Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs (Q3452820) (← links)
• Flexible Graph Connectivity (Q5041731) (← links)
• How to Secure Matchings Against Edge Failures (Q5090488) (← links)
• A Spectral Approach to Network Design (Q5092510) (← links)
• How to Secure Matchings against Edge Failures (Q5157391) (← links)
• An Improved Approximation Algorithm for the Matching Augmentation Problem (Q5883280) (← links)
• Approximation algorithms for flexible graph connectivity (Q6120848) (← links)
• Color-avoiding connected spanning subgraphs with minimum number of edges (Q6130205) (← links)
• Improved approximations for relative survivable network design (Q6574948) (← links)
• Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions (Q6586662) (← links)