Algorithms for Placing Monitors in a Flow Network

DOI10.1007/978-3-642-02158-9_11MaRDI QIDQ3638447zbMATH OpenOpenAlexFDO

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

Publication date 2 July 2009

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02158-9_11

Mathematics Subject Classification ID

Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Recommendations

• Algorithms for placing monitors in a flow network
• scientific article; zbMATH DE number 1919454
• Computing and Combinatorics
• Algorithm for the network flow monitoring set based on primal-dual method
• Estimation of flows in flow networks

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

Cited in

(6)

• Characteristics of optimal solutions to the sensor location problem
• A simple 3-edge connected component algorithm revisited
• Algorithms for placing monitors in a flow network
• scientific article; zbMATH DE number 1919454 (Why is no real title available?)
• 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 Q3638447)