File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/978-3-642-02158-9_11
- Scopus: eid_2-s2.0-70350641432
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Algorithms for Placing Monitors in a Flow Network
| Title | Algorithms for Placing Monitors in a Flow Network |
|---|---|
| Authors | |
| Issue Date | 2009 |
| Publisher | Springer |
| Citation | The 5th International Conference on Algorithmic Aspects in Information and Management (AAIM 2009), San Francisco, CA, 15-17 June 2009. In Algorithmic Aspects in Information and Management, 2009, p. 114-128 How to Cite? |
| Abstract | In the Flow Edge-Monitor Problem, we are given an undirected graph G = (V,E), an integer k > 0 and some unknown circulation ψ on G. We want to find a set of k edges in G, so that if we place k monitors on those edges to measure the flow along them, the total number of edges for which the flow can be uniquely determined is maximized. In this paper, we first show that the Flow Edge-Monitor Problem is NP-hard, and then we give two approximation algorithms: a 3-approximation algorithm with running time O((m + n)2) and a 2-approximation algorithm with running time O((m + n)3), where n = |V| and m = |E|. |
| Persistent Identifier | http://hdl.handle.net/10722/61201 |
| ISBN | |
| ISSN | 2020 SCImago Journal Rankings: 0.249 |
| Series/Report no. | Lecture Notes in Computer Science ; v. 5564 |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Chin, FYL | - |
| dc.contributor.author | Chrobak, M | - |
| dc.contributor.author | Yan, L | - |
| dc.date.accessioned | 2010-07-13T03:33:03Z | - |
| dc.date.available | 2010-07-13T03:33:03Z | - |
| dc.date.issued | 2009 | - |
| dc.identifier.citation | The 5th International Conference on Algorithmic Aspects in Information and Management (AAIM 2009), San Francisco, CA, 15-17 June 2009. In Algorithmic Aspects in Information and Management, 2009, p. 114-128 | - |
| dc.identifier.isbn | 9783642021572 | - |
| dc.identifier.issn | 0302-9743 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/61201 | - |
| dc.description.abstract | In the Flow Edge-Monitor Problem, we are given an undirected graph G = (V,E), an integer k > 0 and some unknown circulation ψ on G. We want to find a set of k edges in G, so that if we place k monitors on those edges to measure the flow along them, the total number of edges for which the flow can be uniquely determined is maximized. In this paper, we first show that the Flow Edge-Monitor Problem is NP-hard, and then we give two approximation algorithms: a 3-approximation algorithm with running time O((m + n)2) and a 2-approximation algorithm with running time O((m + n)3), where n = |V| and m = |E|. | - |
| dc.language | eng | - |
| dc.publisher | Springer | - |
| dc.relation.ispartof | International Conference on Algorithmic Aspects in Information and Management Proceedings | - |
| dc.relation.ispartofseries | Lecture Notes in Computer Science ; v. 5564 | - |
| dc.title | Algorithms for Placing Monitors in a Flow Network | - |
| dc.type | Conference_Paper | - |
| dc.identifier.email | Chin, FYL: chin@cs.hku.hk | - |
| dc.identifier.authority | Chin, FYL=rp00105 | - |
| dc.description.nature | link_to_subscribed_fulltext | - |
| dc.identifier.doi | 10.1007/978-3-642-02158-9_11 | - |
| dc.identifier.scopus | eid_2-s2.0-70350641432 | - |
| dc.identifier.hkuros | 166447 | - |
| dc.identifier.spage | 114 | - |
| dc.identifier.epage | 128 | - |
| dc.publisher.place | Berlin ; Heidelberg | - |
| dc.identifier.issnl | 0302-9743 | - |