Pages that link to "Item:Q3910552"
From MaRDI portal
The following pages link to Approximation Algorithms for Several Graph Augmentation Problems (Q3910552):
Displayed 25 items.
- Hardness of \(k\)-vertex-connected subgraph augmentation problem (Q604752) (← 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)
- 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)
- Approximation algorithms for constructing some required structures in digraphs (Q2255946) (← 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)
- Approximating Transitive Reductions for Directed Networks (Q3183442) (← links)