Approximation algorithms for flexible graph connectivity

We present approximation algorithms for several network design problems in the model of flexible graph connectivity (Adjiashvili et al., in: IPCO, pp 13–26, 2020, Math Program 1–33, 2021). Let k ≥ 1 , p ≥ 1 and q ≥ 0 be integers. In an instance of the ( p , q )-Flexible Graph Connectivity problem,...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 204; no. 1-2; pp. 493 - 516
Main Authors:	Boyd, Sylvia, Cheriyan, Joseph, Haddadan, Arash, Ibrahimpur, Sharat
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2024
Subjects:	Calculus of Variations and Optimal Control; Optimization Combinatorics Full Length Paper Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Theoretical Secondary 90C17 Network design Edge-connectivity of graphs 05C40 Reliability of networks Approximation algorithms 90C59 90C27 Combinatorial optimization Primary 68W25
ISSN:	0025-5610, 1436-4646
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!