Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs.
Joseph CheriyanLászló A. VéghPublished in: FOCS (2013)
Keyphrases
- minimum cost
- connected subgraphs
- undirected graph
- spanning tree
- directed acyclic graph
- biological networks
- np hard
- approximation algorithms
- network flow problem
- network flow
- directed graph
- connected components
- conditional independence
- capacity constraints
- graph structure
- edit operations
- biological systems
- adjacency matrix
- gene expression
- random graphs