{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:36:41Z","timestamp":1743133001661,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642021572"},{"type":"electronic","value":"9783642021589"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02158-9_11","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T15:36:06Z","timestamp":1245252966000},"page":"114-128","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for Placing Monitors in a Flow Network"],"prefix":"10.1007","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","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The Complexity of Multiway Cuts (Extended Abstract). In: 24th ACM Symposium on Theory of Computing, pp. 241\u2013251 (1992)","DOI":"10.1145\/129712.129736"},{"key":"11_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Goldschmidt, O., Hochbaum, D.S.: Polynomial Algorithm for the k-Cut Problem. In: 29th Annual IEEE Symposium on Foundations of Computer Science, pp. 444\u2013451 (1988)","DOI":"10.1109\/SFCS.1988.21960"},{"key":"11_CR4","unstructured":"Gu, W., Jia, X.: On a Traffic Control Problem. In: 8th International Symposium on Parallel Architectures, Algorithms and Networks, pp. 510\u2013515 (2005)"},{"key":"11_CR5","doi-asserted-by":"publisher","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. on Comput.\u00a032, 470\u2013487 (2003)","journal-title":"SIAM J. on Comput."},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Saran, H., Vazirani, V.V.: Finding k-cuts within Twice the Optimal. In: 32nd Annual Symposium on Foundations of Computer Science, pp. 743\u2013751 (1991)","DOI":"10.1109\/SFCS.1991.185443"},{"key":"11_CR7","doi-asserted-by":"publisher","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. Theor. Comp. Sys.\u00a040, 125\u2013142 (2007)","journal-title":"Theor. Comp. Sys."},{"key":"11_CR8","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02158-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T05:42:46Z","timestamp":1739166166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02158-9_11"}},"subtitle":["(Preliminary Version)"],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642021572","9783642021589"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02158-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}