AI Chat AI Image Generator AI Video Text to Speech

A constant factor approximation for the (p,3)-flexible graph connectivity problem

08/30/2023

∙

by Ishan Bansal, et al.

∙

∙

In this article we provide a constant factor approximation for the (p,3)-flexible graph connectivity problem, improving on the previous best known O(p)-approximation.

page 1

page 2

page 3

page 4

research

∙ 02/05/2021

A 2-Approximation Algorithm for Flexible Graph Connectivity

We present a 2-approximation algorithm for the Flexible Graph Connectivi...

0 Sylvia Boyd, et al. ∙

research

∙ 02/13/2022

Locating Charging Stations: Connected, Capacitated and Prize- Collecting

In this paper, we study locating charging station problem as facility lo...

0 Rajni Dabas, et al. ∙

research

∙ 11/06/2019

Breaching the 2-Approximation Barrier for Connectivity Augmentation: a Reduction to Steiner Tree

The basic goal of survivable network design is to build a cheap network ...

0 Jaroslaw Byrka, et al. ∙

research

∙ 11/15/2022

Approximating Flexible Graph Connectivity via Räcke Tree based Rounding

Flexible graph connectivity is a new network design model introduced by ...

0 Chandra Chekuri, et al. ∙

research

∙ 04/10/2018

Approximating Operator Norms via Generalized Krivine Rounding

We consider the (ℓ_p,ℓ_r)-Grothendieck problem, which seeks to maximize ...

0 Vijay Bhattiprolu, et al. ∙

research

∙ 11/20/2022

Probabilistic bounds on the k-Traveling Salesman Problem and the Traveling Repairman Problem

The k-traveling salesman problem (k-TSP) seeks a tour of minimal length ...

0 Moise Blanchard, et al. ∙

research

∙ 01/22/2019

A (4+ε)-approximation for k-connected subgraphs

We obtain approximation ratio 2(2+1/ℓ) for the (undirected) k-Connected ...

0 Zeev Nutov, et al. ∙