Approximation algorithms for flexible graph connectivity

DOI10.4230/LIPICS.FSTTCS.2021.9MaRDI QIDQ6830507zbMATH OpenFDO

Authors Sylvia Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur

Publication date 5 February 2024

zbMATH Keywords

combinatorial optimizationapproximation algorithmsnetwork designreliability of networksedge-connectivity of graphs

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25) Combinatorial optimization (90C27) Approximation algorithms (68W25) Connectivity (05C40)

This page was built for publication: Approximation algorithms for flexible graph connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6830507)