Two-Server Network Disconnection Problem

DOI10.1007/11751595_83MaRDI QIDQ3600164zbMATH OpenOpenAlexFDO

Authors Byung-Cheon Choi, Sung-Pil Hong

Publication date 10 February 2009

Published in Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11751595_83

Mathematics Subject Classification ID

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

Recommendations

• Approximability of the k‐server disconnection problem
• Network disconnection problems in a centralized network
• Optimal serverless networks attacks, complexity and some approximate algorithms
• Optimal attack and reinforcement of a network
• Exact interdiction models and algorithms for disconnecting networks via node deletions

Cited in

(4)

• Two service units with interference in the access to servers
• Optimal serverless networks attacks, complexity and some approximate algorithms
• Network disconnection problems in a centralized network
• Approximability of the k‐server disconnection problem

This page was built for publication: Two-Server Network Disconnection Problem

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