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,...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Mathematical programming Ročník 204; číslo 1-2; s. 493 - 516
Hlavní autori:	Boyd, Sylvia, Cheriyan, Joseph, Haddadan, Arash, Ibrahimpur, Sharat
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2024
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!