Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat

DOI10.1007/978-3-642-29116-6_11zbMATH Open1242.68373OpenAlexW1923722628MaRDI QIDQ2896384

David B. Shmoys, Gwen Spencer

Publication date: 16 July 2012

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29116-6_11

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (2)

Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs. ⋮ Approximation algorithms for fragmenting a graph against a stochastically-located threat

This page was built for publication: Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat

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