{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T19:08:20Z","timestamp":1726513700774},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540660194"},{"type":"electronic","value":"9783540487777"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48777-8_6","type":"book-chapter","created":{"date-parts":[[2007,3,2]],"date-time":"2007-03-02T13:43:11Z","timestamp":1172842991000},"page":"73-86","source":"Crossref","is-referenced-by-count":3,"title":["A Min-Max Theorem on Feedback Vertex Sets (Preliminary Version)"],"prefix":"10.1007","author":[{"given":"Mao-cheng","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaotie","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenan","family":"Zang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,4,30]]},"reference":[{"key":"6_CR1","unstructured":"M. Cai, X. Deng, and W. Zang, A TDI System and Its Application to Approximation Algorithm, Proc. 39th IEEE Symposium on Foundations of Computer Science, Palo Alto, 1998, pp. 227\u2013231."},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","volume":"1","author":"J. Edmonds","year":"1977","unstructured":"J. Edmonds and R. Giles, A Min-max Relation for Submodular Functions on Graphs, Annals of Discrete Mathematics 1 (1977), 185\u2013204.","journal-title":"Annals of Discrete Mathematics"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"J. Edmonds and R. Giles, Total Dual Integrality of Linear Systems, Progress in Combinatorial Optimization (ed. W. R. Pulleyblank), Academic Press, 1984, pp. 117\u2013131.","DOI":"10.1016\/B978-0-12-566780-7.50013-1"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0024-3795(79)90018-1","volume":"25","author":"R. Giles","year":"1979","unstructured":"R. Giles, and W.R. Pulleyblank, Total Dual Integrality and Integral Polyhedra, Linear Algebra Appli. 25 (1979), 191\u2013196.","journal-title":"Linear Algebra Appli"},{"key":"6_CR5","unstructured":"M. X. Goemans and D. P. Williamson, The Primal-Dual Method for Approximation Algorithms and Its Application to Network Design Problems, in: Approximation Algorithms for NP-Hard Problems (ed. D.S. Hochbaum), PWS Publishing Company, 1997, pp. 144\u2013191."},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"A. Schrijver, Total Dual Integrality from Directed Graphs, Crossing Families and Sub-and Supermodular Functions, Progress in Combinatorial Optimization (ed. W. R. Pulleyblank), Academic Press, 1984, pp. 315\u2013362.","DOI":"10.1016\/B978-0-12-566780-7.50025-8"},{"key":"6_CR7","first-page":"1649","volume-title":"Handbook of Combinatorics","author":"A. Schrijver","year":"1995","unstructured":"A. Schrijver, Polyhedral Combinatorics, in Handbook of Combinatorics (eds. R.L. Graham, M. Gro\u00f6tschel, and L. Lov\u00e1sz), Elsevier Science B.V., Amsterdam, 1995, pp. 1649\u20131704."},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0024-3795(81)90005-7","volume":"38","author":"A. Schrijver","year":"1981","unstructured":"A. Schrijver, On Total Dual Integrality, Linear Algebra Appli. 38 (1981), 27\u201332.","journal-title":"Linear Algebra Appli"},{"key":"6_CR9","series-title":"Lect Notes Comput Sci","first-page":"218","volume-title":"On Feedback Problems in Digraphs","author":"E. Speckenmeyer","year":"1989","unstructured":"E. Speckenmeyer, On Feedback Problems in Digraphs, in: Lecture Notes in Computer Science 411, Springer-Verlag, 1989, pp. 218\u2013231."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48777-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T02:18:50Z","timestamp":1556158730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48777-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540660194","9783540487777"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-48777-8_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}