The Steiner k-Cut Problem
From MaRDI portal
Publication:5470831
DOI10.1137/S0895480104445095zbMath1107.68121OpenAlexW2112306992MaRDI QIDQ5470831
Chandra Chekuri, Joseph (Seffi) Naor, Sudipto Guha
Publication date: 1 June 2006
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480104445095
Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (10)
Approximation algorithms for requirement cut on graphs ⋮ Designing FPT Algorithms for Cut Problems Using Randomized Contractions ⋮ Parameterized algorithms for min-max multiway cut and list digraph homomorphism ⋮ LP Relaxation and Tree Packing for Minimum $k$-Cut ⋮ Fast and Deterministic Approximations for k-Cut. ⋮ Multi-Budgeted Directed Cuts ⋮ Approximating Requirement Cut via a Configuration LP ⋮ Unnamed Item ⋮ An improved approximation algorithm for requirement cut ⋮ Multi-budgeted directed cuts
This page was built for publication: The Steiner k-Cut Problem
