Filtering undesirable flows in networks

DOI10.1007/978-3-319-71150-8_1zbMath1470.68238MaRDI QIDQ1699751

Gleb Polevoy, Stojan Trajanovski, Paola Grosso, Cees de Laat

Publication date: 26 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-71150-8_1

zbMATH Keywords

approximation; set cover; local ratio algorithm; MMSA

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68M10: Network design and communication in computer systems

90B10: Deterministic network models in operations research

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W25: Approximation algorithms