{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:39Z","timestamp":1759638219325},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,6,7]],"date-time":"2012-06-07T00:00:00Z","timestamp":1339027200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s00453-012-9665-z","type":"journal-article","created":{"date-parts":[[2012,6,6]],"date-time":"2012-06-06T14:50:38Z","timestamp":1338994238000},"page":"1-15","source":"Crossref","is-referenced-by-count":8,"title":["Algorithms for Placing Monitors in a Flow Network"],"prefix":"10.1007","volume":"68","author":[{"given":"Francis","family":"Chin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Chrobak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,6,7]]},"reference":[{"key":"9665_CR1","first-page":"241","volume-title":"Proceedings of 24th ACM Symposium on Theory of Computing (STOC\u201992)","author":"E. Dahlhaus","year":"1992","unstructured":"Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiway cuts (extended abstract). In: Proceedings of 24th ACM Symposium on Theory of Computing (STOC\u201992), pp.\u00a0241\u2013251 (1992)"},{"key":"9665_CR2","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1145\/265910.265914","volume":"44","author":"D. Eppstein","year":"1997","unstructured":"Eppstein, D., Galil, Z., Italiano, G.F., Nissenzweig, A.: Sparsification\u2014a technique for speeding up dynamic graph algorithms. J. ACM 44, 669\u2013696 (1997)","journal-title":"J. ACM"},{"key":"9665_CR3","volume-title":"Computers and Intractability: A\u00a0Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A\u00a0Guide to the Theory of NP-Completeness. W.H.\u00a0Freeman, San Francisco (1979)"},{"key":"9665_CR4","first-page":"444","volume-title":"Proceedings of 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201988)","author":"O. Goldschmidt","year":"1988","unstructured":"Goldschmidt, O., Hochbaum, D.S.: Polynomial algorithm for the k-cut problem. In: Proceedings of 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201988), pp.\u00a0444\u2013451 (1988)"},{"key":"9665_CR5","first-page":"510","volume-title":"Proceedings of 8th International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN\u201905)","author":"W. Gu","year":"2005","unstructured":"Gu, W., Jia, X.: On a traffic control problem. In: Proceedings of 8th International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN\u201905), pp.\u00a0510\u2013515 (2005)"},{"key":"9665_CR6","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/978-0-387-30162-4_154","volume-title":"Encyclopedia of Algorithms","author":"G.F. Italiano","year":"2008","unstructured":"Italiano, G.F.: Fully dynamic connectivity: upper and lower bounds. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, pp.\u00a0335\u2013337. Springer, Berlin (2008)"},{"issue":"2","key":"9665_CR7","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1137\/S0097539799363359","volume":"32","author":"S. Khuller","year":"2003","unstructured":"Khuller, S., Bhatia, R., Pless, R.: On local search and placement of meters in networks. SIAM J. Comput. 32(2), 470\u2013487 (2003)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9665_CR8","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1137\/S0097539792251730","volume":"24","author":"H. Saran","year":"1995","unstructured":"Saran, H., Vazirani, V.V.: Finding k-cuts within twice the optimal. SIAM J. Comput. 24(1), 101\u2013108 (1995)","journal-title":"SIAM J. Comput."},{"key":"9665_CR9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s00224-005-1269-4","volume":"40","author":"Y.H. Tsin","year":"2007","unstructured":"Tsin, Y.H.: A simple 3-edge-connected component algorithm. Theory Comput. Syst. 40, 125\u2013142 (2007)","journal-title":"Theory Comput. Syst."},{"key":"9665_CR10","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2001)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9665-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-012-9665-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9665-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:10Z","timestamp":1559137510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-012-9665-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,7]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["9665"],"URL":"https:\/\/doi.org\/10.1007\/s00453-012-9665-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,7]]}}}