DeepAI AI Chat
Log In Sign Up

The (2,k)-connectivity augmentation problem: Algorithmic aspects

04/18/2020
by   Florian Hoersch, et al.
Grenoble Institute of Technology
0

Durand de Gevigney and Szigeti <cit.> have recently given a min-max theorem for the (2,k)-connectivity augmentation problem. This article provides an O(n^3(m+ n logn)) algorithm to find an optimal solution for this problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

09/14/2022

Parameterized algorithms for node connectivity augmentation problems

A graph G is k-out-connected from its node s if it contains k internally...
05/10/2022

Edge Connectivity Augmentation in Near-Linear Time

We give an Õ(m)-time algorithm for the edge connectivity augmentation pr...
09/28/2020

Approximation algorithms for connectivity augmentation problems

In Connectivity Augmentation problems we are given a graph H=(V,E_H) and...
08/23/2020

Node-Connectivity Terminal Backup, Separately-Capacitated Multiflow, and Discrete Convexity

The terminal backup problems (Anshelevich and Karagiozova (2011)) form a...
07/28/2020

Dual Half-integrality for Uncrossable Cut Cover and its Application to Maximum Half-Integral Flow

Given an edge weighted graph and a forest F, the 2-edge connectivity aug...
11/16/2020

Faster connectivity in low-rank hypergraphs via expander decomposition

We design an algorithm for computing connectivity in hypergraphs which r...
12/21/2016

Stochastic Runtime Analysis of a Cross Entropy Algorithm for Traveling Salesman Problems

This article analyzes the stochastic runtime of a Cross-Entropy Algorith...