On a Partition LP Relaxation for Min-Cost 2-Node Connected Spanning Subgraphs

11/15/2021
by   Logan Grout, et al.
0

Our motivation is to improve on the best approximation guarantee known for the problem of finding a minimum-cost 2-node connected spanning subgraph of a given undirected graph with nonnegative edge costs. We present an LP (Linear Programming) relaxation based on partition constraints. The special case where the input contains a spanning tree of zero cost is called 2NC-TAP. We present a greedy algorithm for 2NC-TAP, and we analyze it via dual-fitting for our partition LP relaxation. Keywords: 2-node connected graphs, approximation algorithms, connectivity augmentation, greedy algorithm, network design, partition relaxation

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/07/2020

A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case

Given a connected undirected graph G̅ on n vertices, and non-negative ed...
research
05/30/2022

Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver

In the k-edge-connected spanning subgraph (kECSS) problem, our goal is t...
research
02/10/2020

2-node-connectivity network design

We consider network design problems in which we are given a graph G=(V,E...
research
01/22/2021

Partition-Based Convex Relaxations for Certifying the Robustness of ReLU Neural Networks

In this paper, we study certifying the robustness of ReLU neural network...
research
11/24/2018

Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes

Finding the exact integrality gap α for the LP relaxation of the 2-edge-...
research
05/04/2020

Flow-Partitionable Signed Graphs

The NP-hard problem of correlation clustering is to partition a signed g...
research
08/14/2018

A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs

We propose a very simple and natural approximation algorithm for the pro...

Please sign up or login with your details

Forgot password? Click here to reset