Pages that link to "Item:Q3910552"
From MaRDI portal
The following pages link to Approximation Algorithms for Several Graph Augmentation Problems (Q3910552):
Displaying 50 items.
- Hardness of \(k\)-vertex-connected subgraph augmentation problem (Q604752) (← links)
- Regular augmentation of planar graphs (Q747622) (← links)
- Tight bounds for online weighted tree augmentation (Q832514) (← links)
- On the \(L_{\infty}\)-norm of extreme points for crossing supermodular directed network LPs (Q877196) (← links)
- Inferring (biological) signal transduction networks via transitive reductions of directed graphs (Q930591) (← links)
- Inapproximability of the Tutte polynomial (Q937302) (← links)
- A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem (Q1007574) (← links)
- Path hitting in acyclic graphs (Q1018049) (← links)
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs (Q1045053) (← links)
- Vertex covering by paths on trees with its applications in machine translation (Q1045903) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- Edge-connectivity augmentation problems (Q1091147) (← links)
- On the relationship between the biconnectivity augmentation and traveling salesman problems (Q1165162) (← links)
- A minimum 3-connectivity augmentation of a graph (Q1208926) (← links)
- Faster approximation algorithms for weighted triconnectivity augmentation problems (Q1267191) (← links)
- An efficient approximation algorithm for the survivable network design problem (Q1290632) (← links)
- Evolutionary local search for the edge-biconnectivity augmentation problem (Q1603576) (← links)
- LP-relaxations for tree augmentation (Q1706120) (← links)
- Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP (Q1709580) (← links)
- On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem (Q1789587) (← links)
- A smallest augmentation to 3-connect a graph (Q1813979) (← links)
- An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees (Q1821118) (← links)
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree (Q1861569) (← links)
- A primal-dual approximation algorithm for generalized Steiner network problems (Q1900190) (← 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)
- Flexible graph connectivity (Q2118137) (← 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)
- Shorter tours and longer detours: uniform covers and a bit beyond (Q2220659) (← links)
- On the cycle augmentation problem: hardness and approximation algorithms (Q2230719) (← links)
- A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
- Approximation algorithms for constructing some required structures in digraphs (Q2255946) (← links)
- Minimum weight connectivity augmentation for planar straight-line graphs (Q2272377) (← links)
- An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph (Q2656340) (← links)
- On the tree augmentation problem (Q2659770) (← links)
- Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs (Q2688462) (← links)
- Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs (Q2980910) (← links)
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation (Q3057155) (← links)
- Kernelization and complexity results for connectivity augmentation problems (Q3057175) (← links)
- Network flow spanners (Q3057178) (← links)
- A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation (Q3057179) (← links)
- Strongly Connected Spanning Subgraph for Almost Symmetric Networks (Q3132920) (← links)
- Approximating Transitive Reductions for Directed Networks (Q3183442) (← links)
- Fast Distributed Approximation for TAP and 2-Edge-Connectivity (Q3300822) (← links)
- Structured Connectivity Augmentation (Q4555048) (← links)
