Approximability of the k‐server disconnection problem

DOI10.1002/net.20203zbMath1146.68037OpenAlexW2949171332MaRDI QIDQ5434594

Sung-Pil Hong, Byung-Cheon Choi

Publication date: 7 January 2008

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20203

zbMATH Keywords

approximation algorithminapproximabilityfixed-parameter casesserver-network disconnection

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Connectivity (05C40)

Cites Work

• Cut Problems in Graphs with a Budget Constraint

This page was built for publication: Approximability of the k‐server disconnection problem