Algorithms for placing monitors in a flow network

DOI10.1007/s00453-012-9665-zzbMath1286.68183OpenAlexW2520330486MaRDI QIDQ2441585

Francis Y. L. Chin, Li Yan, Marek Chrobak

Publication date: 25 March 2014

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-012-9665-z

zbMATH Keywords

approximation algorithmflow networkmonitors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Flows in graphs (05C21)

Related Items

ON FINDING SPARSE THREE-EDGE-CONNECTED AND THREE-VERTEX-CONNECTED SPANNING SUBGRAPHS ⋮ A simple certifying algorithm for 3-edge-connectivity

Cites Work

• Unnamed Item
• Unnamed Item
• A simple 3-edge-connected component algorithm
• Finding k Cuts within Twice the Optimal
• Sparsification—a technique for speeding up dynamic graph algorithms
• On Local Search and Placement of Meters in Networks

This page was built for publication: Algorithms for placing monitors in a flow network