Algorithms for placing monitors in a flow network

DOI10.1007/S00453-012-9665-ZMaRDI QIDQ2441585zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Algorithms for Placing Monitors in a Flow Network
• Algorithm for the network flow monitoring set based on primal-dual method
• scientific article; zbMATH DE number 42283
• Optimal network-flow-distribution algorithms
• Algorithms for finding optimal flows in dynamic networks
• scientific article; zbMATH DE number 3922330
• Algorithms for Path-Based Placement of Inspection Stations on Networks
• A distributed algorithm for monitor-nodes selection in net traffic measurement
• scientific article; zbMATH DE number 3961334
• An algorithm for labeling network flow problems

Cites work

• A simple 3-edge-connected component algorithm
• Finding k Cuts within Twice the Optimal
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1839431 (Why is no real title available?)
• On Local Search and Placement of Meters in Networks
• Sparsification—a technique for speeding up dynamic graph algorithms

Cited in

(5)

• A simple certifying algorithm for 3-edge-connectivity
• On finding sparse three-edge-connected and three-vertex-connected spanning subgraphs
• Algorithms for Placing Monitors in a Flow Network
• scientific article; zbMATH DE number 1445319 (Why is no real title available?)
• Estimation of flows in flow networks

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

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