Pages that link to "Item:Q4033765"
From MaRDI portal
The following pages link to Approximation Algorithms for Graph Augmentation (Q4033765):
Displaying 40 items.
- Augmenting graphs to minimize the diameter (Q494792) (← links)
- An approximation algorithm for minimum-cost vertex-connectivity problems (Q679445) (← links)
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (Q703542) (← links)
- Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length (Q935155) (← links)
- On finding augmenting graphs (Q955317) (← links)
- Path hitting in acyclic graphs (Q1018049) (← links)
- Faster approximation algorithms for weighted triconnectivity augmentation problems (Q1267191) (← links)
- A unifying augmentation algorithm for two-edge connectivity and biconnectivity (Q1282207) (← links)
- Polynomial time algorithms for 2-edge-connectivity augmentation problems (Q1402224) (← links)
- Evolutionary local search for the edge-biconnectivity augmentation problem (Q1603576) (← links)
- LP-relaxations for tree augmentation (Q1706120) (← links)
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree (Q1861569) (← links)
- A \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from \(1\) to \(2\) (Q1944093) (← links)
- Fast distributed approximation for TAP and 2-edge-connectivity (Q1988524) (← links)
- A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs (Q2019478) (← links)
- Approximation algorithms for vertex-connectivity augmentation on the cycle (Q2085731) (← links)
- On small-depth tree augmentations (Q2102832) (← links)
- Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem (Q2102838) (← links)
- 2-node-connectivity network design (Q2117701) (← links)
- A simple LP-based approximation algorithm for the matching augmentation problem (Q2164677) (← links)
- The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm (Q2191772) (← links)
- On the cycle augmentation problem: hardness and approximation algorithms (Q2230719) (← links)
- On the tree augmentation problem (Q2659770) (← links)
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation (Q3057155) (← links)
- Kernelization and complexity results for connectivity augmentation problems (Q3057175) (← links)
- A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation (Q3057179) (← links)
- Fast Distributed Approximation for TAP and 2-Edge-Connectivity (Q3300822) (← links)
- Better algorithms for minimum weight vertex-connectivity problems (Q5048953) (← links)
- (Q5111750) (← links)
- Approximation algorithms for graph augmentation (Q5204328) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710817) (← links)
- Algorithms and Computation (Q5712107) (← links)
- Node connectivity augmentation via iterative randomized rounding (Q6038664) (← links)
- Correlation clustering and two-edge-connected augmentation for planar graphs (Q6046943) (← links)
- 2-node-connectivity network design (Q6122594) (← links)
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree (Q6156028) (← links)
- A genetic approach for the 2‐edge‐connected minimum branch vertices problem (Q6180021) (← links)
- Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions (Q6586662) (← links)
- Better-than-\(\frac{4}{3}\)-approximations for leaf-to-leaf tree and connectivity augmentation (Q6608041) (← links)
- Approximation algorithms for node and element connectivity augmentation problems (Q6635706) (← links)