The following pages link to (Q4234131):
Displaying 10 items.
- An approximation algorithm for minimum-cost vertex-connectivity problems (Q679445) (← links)
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs (Q1273087) (← links)
- An efficient approximation algorithm for the survivable network design problem (Q1290632) (← links)
- A data structure for bicategories, with application to speeding up an approximation algorithm (Q1342258) (← links)
- A primal-dual approximation algorithm for generalized Steiner network problems (Q1900190) (← links)
- A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs (Q2019478) (← links)
- Primal-dual approximation algorithms for feedback problems in planar graphs (Q4645920) (← links)
- A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs (Q5002603) (← links)
- (Q5002841) (← links)
- Correlation clustering and two-edge-connected augmentation for planar graphs (Q6046943) (← links)
