Cut Problems in Graphs with a Budget Constraint

DOI10.1007/11682462_41zbMath1145.05321OpenAlexW1860789630MaRDI QIDQ3525779

Jochen Könemann, Joseph (Seffi) Naor, Roee Engelberg, Stefano Leonardi

Publication date: 18 September 2008

Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.1984

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (6)

A derandomized approximation algorithm for the critical node detection problem ⋮ A randomized algorithm with local search for containment of pandemic disease spread ⋮ Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions ⋮ Unnamed Item ⋮ Approximability of the k‐server disconnection problem ⋮ Approximation algorithms for fragmenting a graph against a stochastically-located threat

This page was built for publication: Cut Problems in Graphs with a Budget Constraint